You can also download the CFP in adobe's pdf format. We appreciate it if you can help advertise the conference.


CALL FOR PAPERS

The Third International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

CP-AI-OR'06

May 31-June 2, 2006, Cork, Ireland

After a successful series of five international workshops (Ferrara, Paderborn, Ashford, Le Croisic, and Montreal) and two international conferences (Nice, Prague), the third international conference devoted to integration of Constraint Programming, Artificial Intelligence, and Operations Research techniques will be held in Cork, Ireland, in 2006.

The aim of the conference is to bring together interested researchers from AI and OR, and to give them the opportunity to show how the integration of techniques from AI and OR can lead to interesting results on large scale and complex problems. We explicitly welcome new ideas and methods for integrating OR and AI techniques that have arisen from real-world applications. CP-AI-OR is intended primarily as a forum to focus on the integration and hybridization of the approaches of CP, AI, and OR technologies. A secondary aim is to provide an opportunity for researchers in one area to learn about techniques in others. Therefore, papers that actively combine, integrate or contrast approaches from more than one of the areas are solicited. High quality papers from a single area are eligible provided that they are of interest to other communities involved.

CP-AI-OR'06 will be preceded by a Master Class where leading researchers give introductory and overview talks. This year, the topic of the Master Class will be "Modelling and Solving for Uncertainty and Change." The Master Class is intended for PhD students, researchers, and practitioners.

Submissions have now closed.


Accepted Papers

A HYBRID COLUMN GENERATION AND CONSTRAINT PROGRAMMING OPTIMIZER FOR THE
TAIL ASSIGNMENT PROBLEM
Sami Gabteni and Mattias Grönkvist

A TOTAL UNIMODULAR DESCRIPTION OF THE CONSISTENT VALUE POLYTOPE
Ionut Aron, Daniel Leventhal, and Meinolf Sellmann

ALLOCATION, SCHEDULING AND VOLTAGE SCALING ON ENERGYAWARE MPSOCS
Luca Benini, Davide Bertozzi, Alessio Guerri, Michela Milano

AN EFFICIENT AND INTEGRATED STRATEGY FOR TEMPORAL PLANNING
Xing Zhao, Yixin Chen, Weixiong Zhang

AND/OR BRANCH-AND-BOUND SEARCH FOR PURE 0/1 INTEGER LINEAR PROGRAMMING
PROBLEMS
Radu Marinescu, Rina Dechter

CONDITIONAL LEXICOGRAPHIC ORDERS IN CONSTRAINT SATISFACTION PROBLEMS
Richard J. Walalce Nic Wilson

CONFLICT-DIRECTED A* SEARCH FOR SOFT CONSTRAINTS
Martin Sachenbacher and Brian Williams

EVENT-DRIVEN PROBABILISTIC CONSTRAINT PROGRAMMING
S. Armagan Tarim, Brahim Hnich, and Steven D. Prestwich

EXPECTED-CASE ANALYSIS FOR DELAYED FILTERING
Irit Katriel

IMPROVED ALGORITHM FOR THE SOFT GLOBAL CARDINALITY CONSTRAINT
Alessandro Zanarini, Michela Milano, and Gilles Pesant

ON THE SEPARABILITY OF SUBPROBLEMS IN BENDERS DECOMPOSITIONS
Marco Cadoli and Fabio Patrizi

ONLINE STOCHASTIC RESERVATION SYSTEMS
P. Van Hentenryck, R. Bent, Y. Vergados

OPEN CONSTRAINTS IN A CLOSED WORLD
Willem-Jan van Hoeve and Jean-Charles Regin

PLAN B: UNCERTAINTY/TIME TRADE-OFFS FOR LINEAR AND INTEGER PROGRAMMING
Claire Kenyon and Meinolf Sellmann

PROGRESSIVE SOLUTIONS: A SIMPLE BUT EFFICIENT DOMINANCE RULE FOR
PRACTICAL RCPSP
Andras Kovacs and Jozsef Vancza

THE POWER OF SEMIDEFINITE PROGRAMMING RELAXATIONS FOR MAX-SAT
Carla Gomes, Willem Jan van Hoeve and Lucian Leahu

THE RANGE CONSTRAINT: ALGORITHMS AND IMPLEMENTATION
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan,
Toby Walsh

THE TIMETABLE CONSTRAINED DISTANCE MINIMIZATION PROBLEM
Rasmus V. Rasmussen, Michael A. Trick

TRAVELING TOURNAMENT SCHEDULING: A SYSTEMATIC EVALUATION OF SIMULATED
ANNEALLING
Y. Vergados and P. Van Hentenryck

UNDIRECTED FOREST CONSTRAINTS
Nicolas Beldiceanu, Irit Katriel and Xavier Lorca


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

  • Integration of constraint relaxation methods, e.g. constraint propagation, cutting planes, reduced costs, global constraints, graph algorithms, dynamic programming, Lagrangean and convex relaxations, heuristic functions based on constraint relaxation.
  • Integration of search and solving methods, e.g. branch and bound, intelligent backtracking, incomplete search, randomized search, column generation and other decomposition methods, local search, meta-heuristics.
  • Forms of integration, e.g. static/dynamic problem decomposition, linking variables and constraints in different solvers, transformations between models and solvers, methods using information derived by other solving methods, collaboration between concurrent methods, models, and solvers.
  • Problems, modeling, and applications.

Papers should 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). It is planned that the proceedings will be published in the Springer Lecture Notes in Computer Science series (http://www.springer.de/comp/lncs/index.html). All papers are to be submitted electronically in a PDF or PS format by following the instructions at the URL http://tidel.mie.utoronto.ca/cpaior/

Following the conference, authors of all accepted papers will be invited to submit substantially extended versions of their papers to a special issue of the Annals of Operations Research devoted to papers from CP-AI-OR'06. These papers will undergo an additional, very thorough refereeing process and a selection of the best papers will be published.

IMPORTANT DATES FOR AUTHORS

  • Deadline for paper submissions January 9, 2006
  • Notification of acceptance February 24, 2006
  • Camera-ready copy March 7, 2006
  • CP-AI-OR'06 May 31-June 2, 2006
  • Master Class May 30, 2006

ORGANISATION

Conference Chair
Barry O'SullivanCork Constraint Computation Centre, Ireland

Programme Chairs
Chris BeckUniversity of Toronto, Canada
Barbara SmithCork Constraint Computation Centre, Ireland

Master Class Chairs
Ken BrownCork Constraint Computation Centre, Ireland
Armagan TarimCork Constraint Computation Centre, Ireland

Publicity Chair
Ian MiguelUniversity of St. Andrews, Scotland

Sponsorship Chair
Michela MilanoUniversita di Bologna, Italy

Programme Committee
Gautamkumar AppaLondon School of Economics, UK
Philippe BaptisteEcole Polytechnique, France
Roman BartakCharles University, Czech Republic
Mats CarlssonSICS, Sweden
Ondrej CepekCharles University, Czech Republic
Hani El SakkoutCISCO, UK
Bernard GendronCRT and University of Montreal, Canada
Carmen GervetBrown University, USA/Imperial College, UK
Carla GomesCornell University, USA
Narendra JussienEcole des Mines de Nantes, France
Stefan KarischCarmen Systems, Canada
Francois LaburtheBouygues, France
Andrea LodiUniversity of Bologna, Italy
Gilles PesantCRT and Ecole Polytechnique de Montreal, Canada
Jean-Francois PugetILOG, France
Jean-Charles ReginILOG, France
Michel RueherUniversity of Nice-Sophia Antipolis, France
Meinolf SellmannBrown University, USA
Helmut SimonisCrossCore Optimization Ltd, UK
Gilles TrombettoniUniversity of Nice-Sophia Antipolis, France
Michael TrickCarnegie Mellon University, USA
Pascal van HentenryckBrown University, USA
Mark WallaceMonash University, Australia
Weixiong ZhangWashington University, USA

Website
Tom CarchraeCork Constraint Computation Centre, Ireland

 

PmWiki can't process your request

Cannot acquire lockfile

We are sorry for any inconvenience.