<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40"><head><META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=us-ascii"><meta name=Generator content="Microsoft Word 14 (filtered medium)"><style><!--
/* Font Definitions */
@font-face
{font-family:Calibri;
panose-1:2 15 5 2 2 2 4 3 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin-top:0in;
margin-right:0in;
margin-bottom:10.0pt;
margin-left:0in;
line-height:115%;
font-size:11.0pt;
font-family:"Calibri","sans-serif";}
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:blue;
text-decoration:underline;}
a:visited, span.MsoHyperlinkFollowed
{mso-style-priority:99;
color:purple;
text-decoration:underline;}
span.EmailStyle17
{mso-style-type:personal;
font-family:"Calibri","sans-serif";
color:windowtext;}
span.si-deadline
{mso-style-name:si-deadline;}
span.EmailStyle19
{mso-style-type:personal;
font-family:"Calibri","sans-serif";
color:#1F497D;}
span.EmailStyle20
{mso-style-type:personal-reply;
font-family:"Calibri","sans-serif";
color:#1F497D;}
.MsoChpDefault
{mso-style-type:export-only;
font-size:10.0pt;}
@page WordSection1
{size:8.5in 11.0in;
margin:1.0in 1.25in 1.0in 1.25in;}
div.WordSection1
{page:WordSection1;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]--></head><body lang=EN-US link=blue vlink=purple><div class=WordSection1><p class=MsoNormal>Call for Papers<o:p></o:p></p><p class=MsoNormal>MDPI Algorithms Journal<o:p></o:p></p><p class=MsoNormal>Special Issue on Parallel Algorithms for Combinatorial Optimization Problems (<a href="http://www.mdpi.com/journal/algorithms/special_issues/parallel_algorithms">http://www.mdpi.com/journal/algorithms/special_issues/parallel_algorithms</a>)<o:p></o:p></p><p class=MsoNormal>Scope<o:p></o:p></p><p class=MsoNormal>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.<o:p></o:p></p><p class=MsoNormal>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:<o:p></o:p></p><p class=MsoNormal>- Parallel exact algorithms: e.g., divide-and-conquer, dynamic programming, etc.<o:p></o:p></p><p class=MsoNormal>- Parallel approximation algorithms- Parallel fixed parameter algorithms<o:p></o:p></p><p class=MsoNormal>- Parallel heuristics/metaheuristics for combinatorial optimization problems: e.g., local search, simulated annealing, evolutionary computation, swarm intelligence computation, etc.<o:p></o:p></p><p class=MsoNormal>- 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).<o:p></o:p></p><p class=MsoNormal>- Parallel algorithms for multi-objective optimization problems.<o:p></o:p></p><p class=MsoNormal><o:p> </o:p></p><p class=MsoNormal>-----------------------------------------------------------------------------------------<o:p></o:p></p><p class=MsoNormal>Manuscript submission deadline: <span class=si-deadline>February 29, 2016<b><o:p></o:p></b></span></p><p class=MsoNormal> -----------------------------------------------------------------------------------------<o:p></o:p></p><p class=MsoNormal>Guest Editor<o:p></o:p></p><p class=MsoNormal>Dr. Charalampos Konstantopoulos<o:p></o:p></p><p class=MsoNormal>Department of Informatics<o:p></o:p></p><p class=MsoNormal>University of Piraeus, Greece (<a href="mailto:konstant@unipi.gr">konstant@unipi.gr</a>)<o:p></o:p></p><p class=MsoNormal><o:p> </o:p></p><p class=MsoNormal><o:p> </o:p></p></div></body></html>