[hpc-announce] Final CFP and Special Issue: 12th IEEE Workshop on Parallel / Distributed Combinatorics and Optimization (PDCO 2022)

Didier Elbaz elbaz at laas.fr
Thu Feb 3 03:23:51 CST 2022

Please, accept our apologies in case of multiple copies of this CFP.

                  Final submission deadline: February 11, 2022

The 12th IEEE Workshop on Parallel / Distributed
Combinatorics and Optimization (PDCO 2022)

https://pdco2022.sciencesconf.org/ <https://pdco2022.sciencesconf.org/>

           held in conjunction with
         the 36th IEEE International
    Parallel and Distributed Processing Symposium (IPDPS'2022)
                         May 30 - June 3, 2022

                 Lyon, France
http://www.ipdps.org <http://www.ipdps.org/>
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.

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.
Application domains of interest include (but are not limited to) cloud 
computing, planning, logistics, manufacturing, finance, 
telecommunications and computational biology.

* Exact methods, heuristics, metaheuristics, hybrid methods;
* Parallel / distributed algorithms for combinatorial optimization;
* Parallel / distributed  metaheuristics;
* Nature inspired parallel / distributed computing;
* Integer programming, linear programming, nonlinear programming;
* Global optimization, polynomial optimization;
* Cooperative methods, hybrid methods;
* Parallel sparse matrix computations, graph algorithms, load balancing;
* Applications: cloud computing, planning, logistics, manufacturing, 
finance, telecommunications, computational biology, combinatorial 
algorithms in high performance computing.

Steering Committee:
Pascal Bouvry, University of Luxembourg, Luxembourg (co-chair)
Didier El Baz, team CDA, LAAS-CNRS, France (co-chair)
El-Ghazali Talbi, University of Lille, INRIA, CNRS, France
Albert Y. Zomaya, The University of Sydney, Australia

General Chairs:
Grégoire Danoy, University of Luxembourg, Luxembourg
Didier El Baz, team CDA, LAAS-CNRS, France

Program Chairs:
Vincent Boyer, University of Nuevo Leon, Mexico
Bernabe Dorronsoro, Universidad de Cádiz, Spain

Publicity Chairs:
Keqin Li, State University of New York at New Paltz, USA
Laurence T. Yang, St Francis Xavier University, Canada

Program Committee (to be confirmed):
A. Bendjoudi, CERIST, Algiers, Algeria
J.-N. Cao, Hong-Kong Polytechnic University, China
J. J. Durillo, Leibniz Supercomputer Center, Munich, Germany
S. Fujita, Hiroshima University, Japan
M. Halappanavar, Pacific Northwest National Laboratory, USA
K. Li, State University of New York, USA
N. Melab, University of Lille, France
M. Menai, King Saud University, Saudi Arabia
A. Nakib, University Paris 12, France
S. Nesmachnow, Universidad de la República, Uruguay
S. Nikoletseas, University of Patras and CTI, Greece
C. Phillips, Sandia National Laboratories, USA
T. Saadi, University of Picardie, France
M. Seredynski, e-Bus Competence Center, Luxembourg
G. Ch. Sirakoulis, Democritus University of Thrace, Greece
G. Spezzano, University of Calabria, Italy
A. Tchernykh, CICESE Research Center, Mexico
S. Varrette, University of Luxembourg, Luxembourg
F. Xhafa, Polytechnic University of Catalonia, Spain
L.T. Yang, St Francis Xavier University, Canada

Submission :
Papers in the Proceedings of the workshops will be indexed in the IEEE 
Xplore Digital Library after the conference.
Prospective authors should submit their papers through Workshop PDCO 
2022 submission system: 

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 IPDPS website <http://www.ipdps.org/>.

Important Dates:
- Submission deadline: February 11, 2022;
- Decision notification: March 5, 2022;
- Camera-Ready papers due: March 15, 2022;
- Workshop: June 3, 2022.

For questions regarding the Workshop, please contact the conference 
organizers at pdco2022 at sciencesconf.org <mailto:pdco2022 at sciencesconf.org>

Special Issue:

A special issue of the journal Algorithms on the topic: 
Parallel/Distributed Combinatorics and Optimization will bededicated to 
the IEEE Workshop PDCO 2022.

Algorithms (ISSN 1999-4893; CODEN: ALGOCH) is a peer-reviewed 
open-access journal indexed by Emerging Sources Citation Index (ESCI), 
EI, Scopus, and MathSciNet.
The European Society for Fuzzy Logic and Technology (EUSFLAT) is 
affiliated with Algorithms.

Special Issue on: “Parallel/Distributed Combinatorics and Optimization”

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.

Topics of interests include (but are not limited to):
Global optimization, combinatorial optimization, multi-objective 
optimization, dynamic optimization;
Computational intelligence methods (e.g., evolutionary algorithms, swarm 
intelligence, ant colonies, cellular automata, DNA and molecular computing);
Cooperative/competitive methods;
Hybrid algorithm;
Peer-to peer computing and optimization problems;
Real world applications: e.g., cloud computing, planning, logistics, 
manufacturing, finance, telecommunications.

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.

For more details on the special issue, please see: 

<mailto:pdco2022 at sciencesconf.org>

More information about the hpc-announce mailing list