Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems

9th International Conference, CPAIOR 2012, Nantes, France, May 28 – June1, 2012. Proceedings

  • Nicolas Beldiceanu
  • Narendra Jussien
  • Éric Pinson
Conference proceedings CPAIOR 2012
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7298)

Table of contents

  1. Front Matter
  2. Ignacio Araya, Gilles Trombettoni, Bertrand Neveu
    Pages 1-16
  3. David Bergman, Andre A. Cire, Willem-Jan van Hoeve, John N. Hooker
    Pages 34-49
  4. David Bergman, John N. Hooker
    Pages 50-65
  5. Jean-Charles Billaut, Emmanuel Hebrard, Pierre Lopez
    Pages 66-80
  6. Alessio Bonfietti, Michele Lombardi, Luca Benini, Michela Milano
    Pages 81-96
  7. Hadrien Cambazard, Deepak Mehta, Barry O’Sullivan, Luis Quesada
    Pages 97-112
  8. Gilles Chabert, Sophie Demassey
    Pages 113-128
  9. Andre A. Cire, Elvin Coban, Willem-Jan van Hoeve
    Pages 129-145
  10. Nicholas Downing, Thibaut Feydy, Peter J. Stuckey
    Pages 146-162
  11. Graeme Gange, Peter J. Stuckey
    Pages 195-210
  12. Laurent Michel, Pascal Van Hentenryck
    Pages 228-243
  13. Florence Massen, Yves Deville, Pascal Van Hentenryck
    Pages 260-274
  14. Renaud Masson, Fabien Lehuédé, Olivier Péton
    Pages 275-291

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2012, held in Nantes, France, in May/June 2012.

The 26 revised full papers presented were carefully reviewed and
selected from 64 submissions. The papers are focused on both theoretical and practical, application-oriented issues in combinatorial optimization and feature current research with a special focus on inference and relaxation methods, integration methods, modeling methods, innovative applications of CP/AI/OR techniques, and implementation of CP/AI/OR techniques and optimization systems.

Keywords

constraint programming dynamic programming graph algorithms parameterized complexity simple temporal problem

Editors and affiliations

  • Nicolas Beldiceanu
    • 1
  • Narendra Jussien
    • 2
  • Éric Pinson
    • 3
  1. 1.École des Mines de NantesNantes Cedex 3France
  2. 2.École des Mines de NantesNantes Cedex 3France
  3. 3.Institut de Mathématiques AppliquéesAngers Cedex 01France

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-29828-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-29827-1
  • Online ISBN 978-3-642-29828-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book