Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

8th International Conference, CPAIOR 2011, Berlin, Germany, May 23-27, 2011. Proceedings

  • Tobias Achterberg
  • J. Christopher Beck
Conference proceedings CPAIOR 2011
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6697)

Table of contents

  1. Front Matter
  2. Markus Aschinger, Conrad Drescher, Gerhard Friedrich, Georg Gottlob, Peter Jeavons, Anna Ryabokon et al.
    Pages 4-19
  3. David Bergman, Willem-Jan van Hoeve, John N. Hooker
    Pages 20-35
  4. Christian Bessiere, Nina Narodytska, Claude-Guy Quimper, Toby Walsh
    Pages 36-52
  5. Nicolas Chapados, Marc Joliveau, Louis-Martin Rousseau
    Pages 53-58
  6. Carleton Coffrin, Pascal Van Hentenryck, Russell Bent
    Pages 59-75
  7. Bistra Dilkina, Katherine J. Lai, Carla P. Gomes
    Pages 76-91
  8. Andrea Lodi, Gilles Pesant, Louis-Martin Rousseau
    Pages 131-136
  9. Michele Lombardi, Alessio Bonfietti, Michela Milano, Luca Benini
    Pages 137-153
  10. Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff Linderoth, François Margot, Andreas Wächter
    Pages 154-169
  11. Jean-Charles Régin, Thierry Petit
    Pages 190-195
  12. Helmut Simonis, Barry O’Sullivan
    Pages 196-209

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2011, held in Berlin, Germany, in May 2011. The 13 revised full papers and 7 revised short papers presented together with 3 invited lectures were carefully reviewed and selected from 35 submissions. The papers are focused on both theoretical and practical, application-oriented issues and present current research with a special focus on the integration and hybridization of the approaches of constraint programming, artificial intelligence, and operations research technologies for solving large scale and complex real life combinatorial optimization problems.

Keywords

branch-and-cut algorithm complexity cutting planes parallel machines scheduling

Editors and affiliations

  • Tobias Achterberg
    • 1
  • J. Christopher Beck
    • 2
  1. 1.Zuse Institut BerlinBerlinGermany
  2. 2.Department of Computer ScienceUniversity of TorontoTorontoCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-21311-3
  • Copyright Information Springer Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-21310-6
  • Online ISBN 978-3-642-21311-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349