posted by organizer: konstant || 630 views || tracked by 2 users: [display]

MDPI Algorithms Journal 2016 : MDPI Algorithms Journal - Special Issue on Parallel Algorithms for Combinatorial Optimization Problems


When N/A
Where N/A
Submission Deadline Jun 30, 2016
Categories    parallel algorithms   combinatorial optimization

Call For Papers

Call for Papers

MDPI Algorithms Journal

Special Issue on Parallel Algorithms for Combinatorial Optimization Problems (


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.

Manuscript submission deadline: June 30, 2016
Guest Editor
Dr. Charalampos Konstantopoulos
Department of Informatics
University of Piraeus, Greece (

Related Resources

PDAA 2017   9th International Workshop on Parallel and Distributed Algorithms and Applications
CARLA 2017   Latin American HPC Conference - CARLA 2017 - Springer CCIS Series
YSC 2017   International Young Scientists Conference in HPC and Simulation
ATMOS 2017   17th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2017)
ICACS 2017   2017 International Conference on Algorithms, Computing and Systems (ICACS 2017)--Ei Compendex and Scopus
COLT 2018   Computational Learning Theory
data-driven 2017   Special Issue on “Data-Driven User Behavioral Modeling: From Real-World Behavior to Knowledge, Algorithms, and Systems”
LOPAL 2018   International Conference on Learning and Optimization Algorithms: Theory and Applications
ISAAC 2017   International Symposium on Algorithms and Computation
SOSA 2018   Symposium on Simplicity in Algorithms