Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

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
  • © 2010

Overview

Editors:
  1. Andrea Lodi

    1. DEIS, University of Bologna, Bologna, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Michela Milano

    1. DEIS, University of Bologna, Bologna, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Paolo Toth

    1. DEIS, University of Bologna, Bologna, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6140)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CPAIOR 2010.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (38 papers)

  1. Front Matter

    Download chapter PDF

  2. Towards a MIP-Cut Metascheme

    • Matteo Fischetti
    Pages 1-2

  3. Challenges for CPAIOR in Computational Sustainability

    • Carla P. Gomes
    Pages 3-4

  4. Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving

    • Peter J. Stuckey
    Pages 5-9

  5. On Matrices, Automata, and Double Counting

    • Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson
    Pages 10-24

  6. The Increasing Nvalue Constraint

    • Nicolas Beldiceanu, Fabien Hermenier, Xavier Lorca, Thierry Petit
    Pages 25-39

  7. 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

  8. Characterization and Automation of Matching-Based Neighborhoods

    • Thierry Benoist
    Pages 45-50

  9. Rapid Learning for Binary Programs

    • Timo Berthold, Thibaut Feydy, Peter J. Stuckey
    Pages 51-55

  10. Hybrid Methods for the Multileaf Collimator Sequencing Problem

    • Hadrien Cambazard, Eoin O’Mahony, Barry O’Sullivan
    Pages 56-70

  11. Automatically Exploiting Subproblem Equivalence in Constraint Programming

    • Geoffrey Chu, Maria Garcia de la Banda, Peter J. Stuckey
    Pages 71-86

  12. Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition

    • Elvin Coban, John N. Hooker
    Pages 87-91

  13. Integrated Maintenance Scheduling for Semiconductor Manufacturing

    • Andrew Davenport
    Pages 92-96

  14. A Constraint Programming Approach for the Service Consolidation Problem

    • Kanika Dhyani, Stefano Gualandi, Paolo Cremonesi
    Pages 97-101

  15. Solving Connected Subgraph Problems in Wildlife Conservation

    • Bistra Dilkina, Carla P. Gomes
    Pages 102-116

  16. Consistency Check for the Bin Packing Constraint Revisited

    • Julien Dupuis, Pierre Schaus, Yves Deville
    Pages 117-122

  17. A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts

    • Matteo Fischetti, Domenico Salvagnin
    Pages 123-135

  18. An In-Out Approach to Disjunctive Optimization

    • Matteo Fischetti, Domenico Salvagnin
    Pages 136-140

  19. A SAT Encoding for Multi-dimensional Packing Problems

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

  20. Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach

    • Diarmuid Grimes, Emmanuel Hebrard
    Pages 147-161
Back to top

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

Publish with us

Policies and ethics

Back to top

Search

Navigation