Skip to main content
  • Conference proceedings
  • © 2007

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

4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings

Conference proceedings info: CPAIOR 2007.

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 (27 papers)

  1. Front Matter

  2. Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches

    • Davaatseren Baatar, Natashia Boland, Sebastian Brand, Peter J. Stuckey
    Pages 1-15
  3. Connections in Networks: Hardness of Feasibility Versus Optimality

    • Jon Conrad, Carla P. Gomes, Willem-Jan van Hoeve, Ashish Sabharwal, Jordan Suter
    Pages 16-28
  4. Modeling the Regular Constraint with Integer Programming

    • Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau
    Pages 29-43
  5. Hybrid Local Search for Constrained Financial Portfolio Selection Problems

    • Luca Di Gaspero, Giacomo di Tollo, Andrea Roli, Andrea Schaerf
    Pages 44-58
  6. The “Not-Too-Heavy Spanning Tree” Constraint

    • Grégoire Dooms, Irit Katriel
    Pages 59-70
  7. Eliminating Redundant Clauses in SAT Instances

    • Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs
    Pages 71-83
  8. Cost-Bounded Binary Decision Diagrams for 0-1 Programming

    • Tarik Hadžić, J. N. Hooker
    Pages 84-98
  9. YIELDS: A Yet Improved Limited Discrepancy Search for CSPs

    • Wafa Karoui, Marie-José Huguet, Pierre Lopez, Wady Naanaa
    Pages 99-111
  10. A Global Constraint for Total Weighted Completion Time

    • András Kovács, J. Christopher Beck
    Pages 112-126
  11. Necessary Condition for Path Partitioning Constraints

    • Nicolas Beldiceanu, Xavier Lorca
    Pages 141-154
  12. A Constraint Programming Approach to the Hospitals / Residents Problem

    • David F. Manlove, Gregg O’Malley, Patrick Prosser, Chris Unsworth
    Pages 155-170
  13. Best-First AND/OR Search for 0/1 Integer Programming

    • Radu Marinescu, Rina Dechter
    Pages 171-185
  14. A Position-Based Propagator for the Open-Shop Problem

    • Jean-Noël Monette, Yves Deville, Pierre Dupont
    Pages 186-199
  15. Replenishment Planning for Stochastic Inventory Systems with Shortage Cost

    • Roberto Rossi, S. Armagan Tarim, Brahim Hnich, Steven Prestwich
    Pages 229-243
  16. The Deviation Constraint

    • Pierre Schaus, Yves Deville, Pierre Dupont, Jean-Charles Régin
    Pages 260-274

Other Volumes

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

About this book

This book constitutes the refereed proceedings of the 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2007, held in Brussels, Belgium in May 2007.

The 27 revised full papers presented were carefully reviewed and selected from 80 submissions. Methodological and foundational issues from AI, OR, and algorithmics are presented as well as applications to the solution of combinatorial optimization problems in various fields via constraint programming.

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