Special Issue "Parallel Algorithms for Combinatorial Optimization Problems"

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (30 June 2016)

Special Issue Editor

Guest Editor
Dr. Charalampos Konstantopoulos

Department of Informatics, University of Piraeus, Greece
Website | E-Mail
Interests: Design and analysis of algorithms; Parallel and distributed computing; Mobile ad hoc networks; Sensor networks

Special Issue Information

Dear Colleagues,

Combinatorial optimization problems model most of the application scenarios frequently arising in practice. Unfortunately, optimal solutions to these problems are hard to obtain, with most of them having high computational complexity. Even in the case of problems admitting polynomial time solutions, e.g., the classical shortest path problem, the relevant applications should now work on very large input instances or should cope with a large number of concurrent users. Thus, faster solution methods are clearly needed for achieving real time responses for problems previously considered as easy ones. The same also holds for most heuristic methods or approximation algorithms that have been proposed for obtaining approximate solutions for hard optimization problems in acceptable execution times. For large-scale problems, these techniques are inadequate, and much faster algorithmic techniques are needed again.

Due to the aforementioned limitations, parallelism has been considered a means of deriving faster algorithmic solutions. Parallel computation is virtually ubiquitous nowadays and can be found in all modern computing platforms. Although the concept of parallel execution is simple, its application on combinatorial optimization problems is not straightforward, due to the inherently irregular control flow that the algorithms for this kind of problem commonly have. In this Special Issue, we solicit contributions that will propose new methodologies for solving problems in combinatorial optimization using parallel computation, either in shared-memory systems (e.g., multi-core/many-core processors, GPUs, etc.) or in distributed-memory systems (e.g., clusters, cloud architectures, etc.). Topics of interest include, but are not limited to:

- Parallel exact algorithms: e.g., divide-and-conquer, dynamic programming, etc.
- Parallel approximation algorithms- Parallel fixed parameter algorithms
- Parallel heuristics/metaheuristics for combinatorial optimization problems: e.g., local search, simulated annealing, evolutionary computation, swarm intelligence computation, etc.
- Parallel techniques in integer linear programming: e.g., parallelization of branch-and-bound, column generation, and cutting plane methods or their combinations (i.e., branch-and-cut or branch-and-price).
- Parallel algorithms for multi-objective optimization problems.

Charalampos Konstantopoulos
Guest Editor

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 papers will be 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. Algorithms is an international peer-reviewed open access quarterly 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 550 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.


  • Parallel exact algorithms;
  • Parallel approximation algorithms;
  • Parallel fixed parameter algorithms;
  • Parallel heuristics/metaheuristics for combinatorial optimization problems;
  • Parallel techniques in integer linear programming;
  • Parallel algorithms for multi-objective optimization problems

Published Papers

This special issue is now open for submission.

Journal Contact

Algorithms Editorial Office
St. Alban-Anlage 66, 4052 Basel, Switzerland
Tel. +41 61 683 77 34
Fax: +41 61 302 89 18
Editorial Board
Contact Details Submit to Algorithms Edit a special issue Review for Algorithms
Back to Top