Skip to main content
  • Conference proceedings
  • © 2010

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

7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010, Proceedings

Conference proceedings info: CPAIOR 2010.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (38 papers)

  1. Front Matter

  2. Towards a MIP-Cut Metascheme

    • Matteo Fischetti
    Pages 1-2
  3. On Matrices, Automata, and Double Counting

    • Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson
    Pages 10-24
  4. The Increasing Nvalue Constraint

    • Nicolas Beldiceanu, Fabien Hermenier, Xavier Lorca, Thierry Petit
    Pages 25-39
  5. Improving the Held and Karp Approach with Constraint Programming

    • Pascal Benchimol, Jean-Charles Régin, Louis-Martin Rousseau, Michel Rueher, Willem-Jan van Hoeve
    Pages 40-44
  6. Rapid Learning for Binary Programs

    • Timo Berthold, Thibaut Feydy, Peter J. Stuckey
    Pages 51-55
  7. Hybrid Methods for the Multileaf Collimator Sequencing Problem

    • Hadrien Cambazard, Eoin O’Mahony, Barry O’Sullivan
    Pages 56-70
  8. Automatically Exploiting Subproblem Equivalence in Constraint Programming

    • Geoffrey Chu, Maria Garcia de la Banda, Peter J. Stuckey
    Pages 71-86
  9. A Constraint Programming Approach for the Service Consolidation Problem

    • Kanika Dhyani, Stefano Gualandi, Paolo Cremonesi
    Pages 97-101
  10. Solving Connected Subgraph Problems in Wildlife Conservation

    • Bistra Dilkina, Carla P. Gomes
    Pages 102-116
  11. Consistency Check for the Bin Packing Constraint Revisited

    • Julien Dupuis, Pierre Schaus, Yves Deville
    Pages 117-122
  12. A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts

    • Matteo Fischetti, Domenico Salvagnin
    Pages 123-135
  13. An In-Out Approach to Disjunctive Optimization

    • Matteo Fischetti, Domenico Salvagnin
    Pages 136-140
  14. A SAT Encoding for Multi-dimensional Packing Problems

    • Stéphane Grandcolas, Cédric Pinto
    Pages 141-146

Other Volumes

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

Editors and Affiliations

  • DEIS, University of Bologna, Bologna, Italy

    Andrea Lodi, Michela Milano, Paolo Toth

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access