Skip to main content

Bioinspired Optimization Methods and Their Applications

10th International Conference, BIOMA 2022, Maribor, Slovenia, November 17–18, 2022, Proceedings

  • Conference proceedings
  • © 2022

Overview

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 13627)

Included in the following conference series:

Conference proceedings info: BIOMA 2022.

  • 8208 Accesses

  • 2 Citations

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 54.99
Price excludes VAT (Canada)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This book constitutes the refereed proceedings of the 10th International Conference on Bioinspired Optimization Methods and Their Applications, BIOMA 2022, held in Maribor, Slovenia, in November 2022.

The 19 full papers presented in this book were carefully reviewed and selected from 23 submissions.

The papers in this BIOMA proceedings specialized in bioinspired algorithms as a means for solving the optimization problems and came in two categories: theoretical studies and methodology advancements on the one hand, and algorithm adjustments and their applications on the other.


Similar content being viewed by others

Keywords

Table of contents (19 papers)

Other volumes

  1. Bioinspired Optimization Methods and Their Applications

Editors and Affiliations

  • University of Maribor, Maribor, Slovenia

    Marjan Mernik, Matej Črepinšek

  • Jožef Stefan Institute, Ljubljana, Slovenia

    Tome Eftimov

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Publish with us