My apologies if you receive multiple copies of this message.

----------------------------------------------------------------------

                           CALL FOR PAPERS

                            CP-AI-OR 2009

     Sixth International Conference on Integration of Artificial
    Intelligence and Operations Research Techniques in Constraint
         Programming for Combinatorial Optimization Problems

                           May 27-31,  2009
                            Pittsburgh, PA

                            www.cpaior.org

----------------------------------------------------------------------


After a successful  series of  five international  workshops (Ferrara,
Paderborn,  Ashford, Le Croisic, and  Montreal) and five international
conferences  (Nice,  Prague,  Cork, Brussels,  and  Paris),  the sixth
international conference on Integration of Artificial Intelligence and
Operations   Research   techniques   in  Constraint  Programming   for
Combinatorial  Optimization  Problems  will  be  held  in  Pittsburgh,
Pennsylvania (USA), May 27-31, 2009.

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.  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,
provided  that they are  of interest  to  other  communities involved.
Finally,   application  papers  showcasing   CP/AI/OR  techniques   on
innovative and challenging  applications or experience reports on such
applications are strongly encouraged.

CP-AI-OR'09  will be  preceded  by a day  of workshops,  and a two-day
Tutorial where  leading  researchers  give  introductory  and overview
talks.  The tutorial is intended  for PhD students,  researchers,  and
practitioners.

The  program committee  invites  submissions that include but are  not
limited to the following topics:

   1. Relaxation methods, e.g. constraint propagation, cutting planes,
   global constraints, graph algorithms,  dynamic programming,  convex
   and Lagrangian relaxations, heuristic functions based on constraint
   relaxation.
   2. Search methods, e.g. branch and bound, intelligent backtracking,
   incomplete search,  randomized search,  column generation and other
   decomposition methods, local search, meta-heuristics.
   3. Integration methods,  e.g. static/dynamic problem decomposition,
   solver  communication, transformations between  models and solvers,
   collaboration between concurrent methods, models, and solvers.
   4. Modeling methods, e.g., comparison of models, symmetry breaking,
   uncertainty, dominance relationships.
   5. Innovative Applications of CP/AI/OR techniques.
   6. Implementation of CP/AI/OR techniques and Optimization Systems.

Paper submissions are of two types: Full papers and extended abstracts.

Full papers should present original unpublished work and be at most 15
pages in length,  and should  be prepared  in the format  used for the
Springer Lecture Notes in Computer Science series
(http://www.springer.de/comp/lncs/authors.html).   These  papers  will
undergo  rigorous review.  The proceedings  will be  published in  the
Springer Lecture Notes in Computer Science series.  All papers  are to
be  submitted  electronically  in a PDF or PS format  by following the
instructions at the URL
http://www.easychair.org/conferences/?conf=cpaior2009.

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  will  be  published in  the conference volume, and
must  be prepared using the same  format as full papers.  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.


Important Dates

Timeline for Full Papers:

   January 10, 2009 - Abstract due for full papers
   January 16, 2009 - Full papers due
   February 21, 2009 - Notification of acceptance for full papers
   March 7, 2009 - Final version of full papers due

Timeline for Extended Abstracts:

   February 15, 2009 - Extended abstracts due
   March 1, 2009 - Notification of acceptance for extended abstracts
   March 7, 2009 - Final version of extended abstracts due


Conference Organizers and Program Chairs

   John Hooker, Carnegie Mellon University
   Willem-Jan van Hoeve, Carnegie Mellon University

Tutorial Chair

   Gilles Pesant, Universite de Montreal




_________________________________________________________________________________
mozart-users mailing list                               
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users

Reply via email to