Special Issue on Parallel Computing and Combinatorial Optimization  

 

Parallel computing is receiving a rapidly increasing amount of attention. In theory, a collection of processors that operate in parallel can achieve substantial speedups. Parallel computing and combinatorial optimization aims at providing a forum in the field of parallel computing for difficult combinatorial optimization problems, like cutting stock problems, large scale linear programming problems, nonlinear optimization problems and global optimization problems. It is widely application in cloud computing, planning, logistics, manufacturing, finance, telecommunications, and computational biology.

 

In this special issue, we intend to invite front-line researchers and authors to submit original research and review articles on exploring parallel computing and combinatorial optimization. Potential topics include, but are not limited to:

• Integer programming, linear programming, nonlinear programming
• Global optimization, polynomial optimization
• Exact methods and heuristics
• Parallel algorithms for combinatorial optimization
• Parallel metaheuristics
• Distributed optimization algorithms
• Hybrid computing
• Peer to peer computing and optimization problems
• Applications

 

Authors should read over the journal’s For Authors carefully before submission. Prospective authors should submit an electronic copy of their complete manuscript through the journal’s Paper Submission System.

 

Please kindly specify the “Special Issue” under your manuscript title. The research field “Special Issue - Parallel Computing and Combinatorial Optimization” should be selected during your submission.

 

Special Issue timetable:

 

Guest Editors:

Prof. Didier El Baz  

LAAS-CNRS, Toulouse, France  

Prof. Mhand Hifi  

EPROAD, UPJV, France  

Prof. Bora Uçar  

CNRS and ENS Lyon, France

 

For further questions or inquiries

Please contact Editorial Assistant at

ajor@scirp.org