[hpc-announce] Final CFP: Workshop IEEE PDCO 2019 in conjunction with IEEE IPDPS'2019 Rio de Janeiro

Didier Elbaz elbaz at laas.fr
Mon Jan 28 04:10:26 CST 2019


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

***************************************************************************

The 9th IEEE Workshop on Parallel / Distributed

Combinatorics and Optimization (PDCO 2019)

https://pdco2019.sciencesconf.org/

held in conjunction with

the 33rd IEEE International

Parallel and Distributed Processing Symposium (IPDPS'2019)

May 20-24, 2019

Rio de Janeiro, Brazil

http://www.ipdps.org <http://www.ipdps.org/>

***************************************************************************

============================================

FINAL DEADLINE: February 10, 2019

Journal Special Issue invitation for selected best papers

============================================

Scope:

======

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.

Topics:

=======

* Exact methods, heuristics, metaheuristics, hybrid methods;

* Parallel / distributed algorithms for combinatorial optimization;

* Parallel / distributedmetaheuristics;

* 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 completed):

====================================

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, Luxembourg Institute of Science and Technology, 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 
2019 submission system (EasyChair): 
https://easychair.org/conferences/?conf=pdco2019

Abstract and paper can be uploaded until February 10, 2019. Authors 
should preferably follow the manuscript specificationsof 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/ipdps2019/2019-call-for-papers.html>.

Special Issue:

============

Selected papers from PDCO 2019 will be invited to submit an extended 
version to a special issue of an international high-quality journal. 
Detailed information will soon be announced and will be made available 
on the conference website.

Important Dates:

================

- Submission Deadline: February 10, 2019

- Author notification: March 1, 2019

- Camera ready version: March 15, 2019

- Workshop: May 20, 2019

Contact:

========

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

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://lists.mcs.anl.gov/mailman/private/hpc-announce/attachments/20190128/375ebd9f/attachment-0001.html>


More information about the hpc-announce mailing list