[Scip] CPAIOR 2011 - Final Call for Late Breaking Abstracts

[Timo Berthold]

                Final Call for Late Breaking Abstracts
                             CPAIOR 2011

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

                   ZUSE INSTITUTE BERLIN - GERMANY

                          MAY 23 - 27, 2011


============================================================================
        * revised deadlines *

DEADLINES FOR LATE BREAKING ABSTRACT SUBMISSION:
Abstract due: APRIL 5, 2011 11:59 P.M. PST
Notification: APRIL 6, 2011

DEADLINE FOR EARLY REGISTRATION: April 7, 2011 11:59 PST

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


The Eighth International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint Programming
will be held in Berlin, Germany, May 23-27, 2011.

URL: http://cpaior2011.zib.de/site/make.php?event=cpaior2011

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 nor published in the conference
proceedings. 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.

There is no strict limit on the number of pages, but about one or two
pages is expected. Please submit your abstracts as a PDF, preferably in
LNCS style format (http://www.springer.de/comp/lncs/authors.html).


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.


SUBMISSION NOTES:
All abstracts are to be submitted electronically in PDF format by
following the instructions at the URL

http://www.easychair.org/conferences/?conf=cpaior2011

For any queries on the abstract submission process, please contact the
Program Chairs at the email cpaior-pc at zib.de.


CONFERENCE ORGANIZATION:
Program Chairs
Tobias Achterberg
J. Christopher Beck

Conference Chairs
Timo Berthold
Ambros M. Gleixner
Stefan Heinz
Thorsten Koch