<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
</head>
<body>
<p><span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Please,
accept our apologies in case of multiple copies of
this CFP. </span></span></span></span></span></span><br>
<br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">***************************************************************************<br>
Final submission deadline: February
11, 2022</span></span></span></span></span></span><br>
<br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">
The 12th IEEE Workshop on Parallel / Distributed </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">
Combinatorics and Optimization (PDCO 2022) </span></span></span></span></span></span><br>
<br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif"><span
style="color:#0950d0"> <a
style="color:#0563c1; text-decoration:underline"
rel="noopener" target="_blank"
href="https://pdco2022.sciencesconf.org/"><span
style="color:#0950d0">https://pdco2022.sciencesconf.org/</span></a>
</span></span></span></span></span></span></span><br>
<br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">
held in conjunction with </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">
the 36th IEEE International </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif"> Parallel
and Distributed Processing Symposium (IPDPS'2022) </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">
May 30 - June 3, 2022</span></span></span></span></span></span><br>
<br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">
Lyon, France</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">
<a style="color:#0563c1;
text-decoration:underline" rel="noopener"
target="_blank" href="http://www.ipdps.org/"><span
style="color:#0950d0">http://www.ipdps.org</span></a>
</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">***************************************************************************</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Scope: </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">====== </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">The IEEE
Workshop on Parallel / Distributed Combinatorics and
Optimization aims at providing a forum for scientific
researchers and engineers on recent advances in the
field of parallel or distributed combinatorics for
difficult optimization problems, ranging from
theoretical to applied problems. The latter include
for instance 0-1 multidimensional knapsack problems
and cutting stock problems, large scale linear
programming problems, nonlinear optimization problems,
global optimization and scheduling problems. </span></span></span></span></span></span><br>
<br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Emphasis will
be placed on new techniques for solving difficult
optimization problems, like cooperative methods for
integer programming problems, nature-inspired
techniques and hybrid methods. Aspects related to
Combinatorial Scientific Computing (CSC) will also be
treated. We also solicit submissions of original
manuscripts on sparse matrix computations and related
topics (including graph algorithms); and related
methods and tools for their efficiency on different
parallel systems. Applications combining traditional
parallel and distributed combinatorics and
optimization techniques as well as theoretical issues
(convergence, complexity, etc.) are welcome.</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Application
domains of interest include (but are not limited to)
cloud computing, planning, logistics, manufacturing,
finance, telecommunications and computational biology.
</span></span></span></span></span></span><br>
<br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Topics: </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">======= </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">* Exact
methods, heuristics, metaheuristics, hybrid methods; </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">* Parallel /
distributed algorithms for combinatorial optimization;
</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">* Parallel /
distributed metaheuristics; </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">* Nature
inspired parallel / distributed computing; </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">* Integer
programming, linear programming, nonlinear
programming; </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">* Global
optimization, polynomial optimization; </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">* Cooperative
methods, hybrid methods; </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">* Parallel
sparse matrix computations, graph algorithms, load
balancing; </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">*
Applications: cloud computing, planning, logistics,
manufacturing, finance, telecommunications,
computational biology, combinatorial algorithms in
high performance computing. </span></span></span></span></span></span><br>
<br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Steering
Committee: </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">===================
</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Pascal
Bouvry, University of Luxembourg, Luxembourg
(co-chair) </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Didier El
Baz, team CDA, LAAS-CNRS, France (co-chair) </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">El-Ghazali
Talbi, University of Lille, INRIA, CNRS, France </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Albert Y.
Zomaya, The University of Sydney, Australia </span></span></span></span></span></span><br>
<br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">General
Chairs: </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">===============
</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Grégoire
Danoy, University of Luxembourg, Luxembourg </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Didier El
Baz, team CDA, LAAS-CNRS, France </span></span></span></span></span></span><br>
<br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Program
Chairs: </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">===============
</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Vincent
Boyer, University of Nuevo Leon, Mexico </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Bernabe
Dorronsoro, Universidad de Cádiz, Spain </span></span></span></span></span></span><br>
<br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Publicity
Chairs: </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">=================
</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Keqin Li,
State University of New York at New Paltz, USA </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Laurence T.
Yang, St Francis Xavier University, Canada </span></span></span></span></span></span><br>
<br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Program
Committee (to be confirmed): </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">====================================
</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">A. Bendjoudi,
CERIST, Algiers, Algeria</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">J.-N. Cao,
Hong-Kong Polytechnic University, China</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">J. J.
Durillo, Leibniz Supercomputer Center, Munich, Germany</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">S. Fujita,
Hiroshima University, Japan</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">M.
Halappanavar, Pacific Northwest National Laboratory,
USA</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">K. Li, State
University of New York, USA</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">N. Melab,
University of Lille, France</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">M. Menai,
King Saud University, Saudi Arabia</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">A. Nakib,
University Paris 12, France</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">S.
Nesmachnow, Universidad de la República, Uruguay</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">S.
Nikoletseas, University of Patras and CTI, Greece</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">C. Phillips,
Sandia National Laboratories, USA</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">T. Saadi,
University of Picardie, France</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">M.
Seredynski, e-Bus Competence Center, Luxembourg</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">G. Ch.
Sirakoulis, Democritus University of Thrace, Greece</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">G. Spezzano,
University of Calabria, Italy</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">A. Tchernykh,
CICESE Research Center, Mexico</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">S. Varrette,
University of Luxembourg, Luxembourg</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">F. Xhafa,
Polytechnic University of Catalonia, Spain</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">L.T. Yang, St
Francis Xavier University, Canada</span></span></span></span></span></span><br>
<br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Submission :
</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">============
</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Papers in the
Proceedings of the workshops will be indexed in the
IEEE Xplore Digital Library after the conference. </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Prospective
authors should submit their papers through Workshop
PDCO 2022 submission system: <a style="color:#0563c1;
text-decoration:underline" rel="noopener"
target="_blank"
href="https://ssl.linklings.net/conferences/ipdps/?page=submit&id=pdcoworkshopfullsubmission&site=ipdps2022"><span
style="text-decoration:none"><span
style="text-underline:none">https://ssl.linklings.net/conferences/ipdps/?page=Submit&id=PDCOWorkshopFullSubmission&site=ipdps2022</span></span></a></span></span></span></span></span></span><br>
<br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Abstract and
paper can be uploaded until February 11, 2022. Authors
should preferably follow the manuscript
specifications of IEEE IPDPS, i.e. submitted
manuscripts may not exceed 10 single-spaced
double-column pages using 10-point size font on 8.5x11
inch pages (IEEE conference style), including figures,
tables and references. Style templates are available
on <a style="color:#0563c1;
text-decoration:underline" rel="noopener"
target="_blank" href="http://www.ipdps.org/"><span
style="color:#0950d0">IPDPS website</span></a>. <br>
</span></span></span></span></span></span></p>
<p><span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Important
Dates: </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">================
</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">- Submission
deadline: February 11, 2022;</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">- Decision
notification: March 5, 2022;</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">-
Camera-Ready papers due: March 15, 2022;</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">- Workshop:
June 3, 2022.</span></span></span></span></span></span><br>
<br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Contact: </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">======== </span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">For questions
regarding the Workshop, please contact the conference
organizers at <a style="color:#0563c1;
text-decoration:underline" rel="noopener"
target="_blank"
href="mailto:pdco2022@sciencesconf.org"><span
style="color:#0950d0">pdco2022@sciencesconf.org</span></a></span></span></span></span></span></span>
<br>
<br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">Special
Issue:</span></span></span></span></span></span><br>
<span style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif">============</span></span></span></span></span></span><br>
</p>
<p class="MsoNormal">A special issue of the journal Algorithms on
the topic:
Parallel/Distributed Combinatorics and Optimization will be<span
style="mso-spacerun:yes"> </span>dedicated to the IEEE
Workshop PDCO 2022.</p>
Algorithms (ISSN 1999-4893; CODEN: ALGOCH) is a
peer-reviewed open-access journal indexed by Emerging Sources
Citation Index
(ESCI), EI, Scopus, and MathSciNet.<br>
The European Society for Fuzzy Logic and Technology
(EUSFLAT) is affiliated with Algorithms.
<p class="MsoNormal">Special Issue on: “Parallel/Distributed
Combinatorics and
Optimization”
</p>
<p class="MsoNormal">Description: The recent advances in parallel
computing capacities, e.g.,
multi-core and many-core processors, nowadays allow to tackle
large-scale
complex optimization problems.However, novel parallel/distributed
optimization
paradigms have to be designed and new implementations provided in
order to
fully exploit such novel and possibly heterogenous computing
environments.
These new solvers target different conflicting objectives such as
obtaining
high-quality solutions while minimizing computing time or energy
usage. The goal of this special issue is to gather the most
important contemporary developments and designs in parallel and
distributed
combinatorics, as well as optimization methods for solving
difficult
optimization problems.</p>
<span style="mso-spacerun:yes"></span>Topics of interests
include (but are not limited to): <span style="mso-spacerun:yes"><br>
</span>Global
optimization, combinatorial optimization, multi-objective
optimization, dynamic
optimization;<span style="mso-spacerun:yes"></span><br>
<span style="mso-spacerun:yes"></span><span style="mso-spacerun:yes">
</span>Computational
intelligence methods (e.g., evolutionary algorithms, swarm
intelligence, ant
colonies, cellular automata, DNA and molecular computing);<span
style="mso-spacerun:yes"></span><br>
<span style="mso-spacerun:yes"></span><span style="mso-spacerun:yes">
</span>Cooperative/competitive methods;<span
style="mso-spacerun:yes"></span><br>
<span style="mso-spacerun:yes"></span><span style="mso-spacerun:yes">
</span>Hybrid algorithm;<span style="mso-spacerun:yes"></span><br>
<span style="mso-spacerun:yes"></span><span style="mso-spacerun:yes">
</span>Peer-to peer
computing and optimization problems;<span style="mso-spacerun:yes"></span><br>
<span style="mso-spacerun:yes"></span><span style="mso-spacerun:yes">
</span>Real world
applications: e.g., cloud computing, planning, logistics,
manufacturing,
finance, telecommunications.
<p class="MsoNormal">The organization of this special issue is
linked to the 12th
IEEE Workshop Parallel / Distributed Combinatorics and
Optimization (PDCO 2022),
that will be take place together with the 36th IEEE International
Parallel and
Distributed Symposium (IPDPS 2022) in Lyon, France, May-June 2022.
Outstanding papers from the workshop will be considered for
possible
publication in the special issue, after a peer review process. The
special issue is open to any submissions, and not
restricted to papers from the PDCO workshop.
</p>
<p class="MsoNormal">For more details on the special issue, please
see: <a class="moz-txt-link-freetext" href="https://pdco2022.sciencesconf.org/resource/page/id/6">https://pdco2022.sciencesconf.org/resource/page/id/6</a></p>
<p class="MsoNormal"><br>
</p>
<p><span style="color: #888888;"></span><span style="color:
#888888;"><strong></strong><span><span style="color: #888888;"></span></span></span><span
style="font-size:11pt"><span style="line-height:normal"><span
style="text-autospace:none"><span
style="font-family:Calibri,sans-serif"><span
style="font-size:12.0pt"><span
style="font-family:Helvetica,sans-serif"><br>
</span></span></span></span></span></span></p>
</body>
</html>