Combinatorial Optimization and Algorithms

Dear Colleagues,

Optimization problems are present in various areas worldwide, and most real-world optimization problems are difficult or impossible to solve via traditional, exact methods due to their computational complexity. The problem with exact methods is that their computational complexity may grow exponentially as the size of the search space grows. Therefore, tremendous efforts have been dedicated to the development of stochastic algorithms, which may be a feasible approach to solving combinatorial optimization problems by finding near-optimal solutions in a reasonable time.

As a consequence of the wide range of optimization problems, it is anticipated that this research domain will continue to motivate and attract the attention of the research community and lead to significant progress in the application of methods successfully addressing complex real-life optimization problems.

This Special Issue, entitled “Combinatorial Optimization and Algorithms”, aims to promote and effectively disseminate scientific knowledge, discoveries, research findings and contributions related to combinatorial optimization models and algorithms, as well as their applications. Authors are encouraged to submit their original manuscripts in order to address (not exclusively) the following topics:

• Combinatorial optimization
• Approximation algorithms
• Discrete optimization
• Computational complexity
• Metaheuristics
• Heuristics
• Linear programming
• Nonlinear programming
• Mixed-integer programming
• Evolutionary algorithms
• Multi-objective optimization
• Applications of combinatorial optimization
• Stochastic optimization
• Optimization problems
• Graph theory.

Dr. Miodrag Živković
Guest Editor

Timea Bezdan
Guest Editor Assistant

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

• combinatorial optimization
• stochastic optimization
• metaheuristics
• swarm intelligence
• neuroevolution
• evolutionary algorithms
• global optimization
• multi-objective optimization
• algorithms
• optimization problems