Programming, Artificial Intelligence, and Operations Research will be held
in Thessaloniki, Greece, June 4 – 7, 2019.
The aim of the conference is to bring together interested researchers from
Constraint Programming (CP), Artificial Intelligence (AI), and Operations
Research (OR) to present new techniques or applications and to provide an
opportunity for researchers in one area to learn about techniques in the
others. A main objective of this conference series is also to give these
researchers the opportunity to show how the integration of techniques from
different fields can lead to interesting results on large and complex
problems. Therefore, papers that actively combine, integrate, or contrast
approaches from more than one of the areas are especially solicited. High
quality papers from a single area are also welcome, if they are of interest
to other communities involved. Application papers showcasing CP/AI/OR
techniques on novel and challenging applications or experience reports on
such applications are strongly encouraged.
The program committee invites submissions that include but are not limited
to the following topics:
• Inference and relaxation methods: constraint propagation, cutting planes,
global constraints, graph algorithms, dynamic programming, Lagrangian and
convex relaxations, heuristic functions based on constraint relaxation.
• Search methods: branch and bound, intelligent backtracking, incomplete
search, randomized search, portfolios, column generation, Benders
decompositions or any other decomposition methods, local search,
meta-heuristics.
• AI and Machine Learning techniques applied to solve optimization and
Operations Research problems.
• Integration methods: solver communication, model transformations and
solver selection, parallel and distributed solving, combining machine
learning with combinatorial optimization.
• Modeling methods: comparison of models, symmetry breaking, uncertainty,
dominance relationships.
• Innovative applications of CP/AI/OR techniques.
• Implementation of CP/AI/OR techniques and optimization systems.
INSTRUCTIONS FOR EXTENDED ABSTRACTS
Extended abstracts should be 1 or 2 pages in length and may present
preliminary work or work already published in other outlets. The extended
abstracts are submitted for presentation only (if accepted), and will not
be formally published in the LNCS conference volume. A collection of the
accepted extended abstracts will be published on the conference website. A
submission representing work submitted or published in another outlet
should state that outlet. Extended abstracts will be reviewed to ensure
appropriateness for the conference.
Submission schedule for extended abstracts:
Abstract: March 1, 2019
Notification: March 16, 2019
Submission Process
All papers are to be submitted electronically in PDF format by following
the instructions at the URL
https://easychair.org/conferences/conference_dir.cgi?a=19471328
QUESTIONS
For any queries on the submission process, please contact the Program
Chairs Louis-Martin Rousseau and Kostas Stergiou at: cpaior2019@uowm.gr
--
Andre Augusto Cire
Assistant Professor in Operations Management
Department of Management, University of Toronto Scarborough
Rotman School of Management (cross-appoint.)
Phone: +1-416-208-4838 (UTSC), +1-416-978-5454 (Rotman)
acire@utsc.utoronto.ca
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************