[DMANET] Call for abstracts for CPAIOR 2013 (due Feb 10)

Call for PRESENTATION-ONLY ABSTRACTS

CPAIOR 2013

Tenth International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming

web: http://www.cis.cornell.edu/ics/cpaior2013/
cpaior series: http://www.andrew.cmu.edu/user/vanhoeve/cpaior/

IBM Research, Yorktown Heights, NY, USA

MAY 18 - 22, 2013


==============================================================================
DEADLINES FOR PRESENTATION-ONLY ABSTRACT SUBMISSION:

Abstract due: Feb 10, 2013 11.59 P.M. PST
Notification: Mar 1, 2013

SUBMISSION NOTES:
An abstract of no more than 200 words should be submitted through the
submission page. Names and affiliations of all authors should be
provided, with the presenting author listed first.

Submission URL:
http://www.easychair.org/conferences/?conf=cpaior2013
==============================================================================

The Tenth International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming will be held in Yorktown Heights, NY, USA, May 18-22, 2013
with a Master Class on CP and OR on May 18, Workshops on May 19 and
Main Program on May 20-22, 2013.

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 new applications
in combinatorial optimization 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.

In addition to short and long papers, this year the program committee
invites researchers to submit abstracts about current or recent work
in order to provide the opportunity to present exciting results
(published or unpublished) or work in progress at the conference. The
main goal is to stimulate discussions at the conference and to
initiate future collaboration between participants.

The abstracts will not be peer-reviewed. The Program Chairs will
select the most relevant and highest quality abstracts for
presentation. We expect to have time slots of 10 to 15 minutes for
each of these talks. All accepted presentation-only abstracts will be
printed in the conference program. Abstracts should not exceed 200
words.

Suitable topics include but are not limited to the following:

* Inference and relaxation methods: constraint propagation, cutting
planes, global constraints, graph algorithms, dynamic programming,
Lagrangean and convex relaxations, heuristic functions based on
constraint relaxation.

* Search methods: branch and bound, intelligent backtracking,
incomplete search, randomized search, column generation and other
decomposition methods, local search, meta-heuristics.

* Integration methods: static/dynamic problem decomposition, solver
communication, transformations between models and solvers,
collaboration between concurrent methods, models, and solvers.

* 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.


For any queries on the submission process, please contact the Program
Chairs using the email cpaior2013@gmail.com .


PROGRAM CHAIRS:
Carla Gomes
Meinolf Sellmann
**********************************************************
*
* 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/
*
**********************************************************