Skip to main content
SpringerLink
Log in

Integration of AI and OR Techniques in Constraint Programming

14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017, Proceedings

  • Conference proceedings
  • © 2017

Overview

Editors:
  1. Domenico Salvagnin

    1. University of Padua, Padua, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Michele Lombardi

    1. 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 10335)

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

Included in the following conference series:

Conference proceedings info: CPAIOR 2017.

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

Table of contents (32 papers)

  1. Front Matter

    Pages I-XXIII
    Download chapter PDF

  2. Technical Papers

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Sharpening Constraint Programming Approaches for Bit-Vector Theory

      • Zakaria Chihani, Bruno Marre, François Bobot, Sébastien Bardin
      Pages 3-20

    3. Range-Consistent Forbidden Regions of Allen’s Relations

      • Nicolas Beldiceanu, Mats Carlsson, Alban Derrien, Charles Prud’homme, Andreas Schutt, Peter J. Stuckey
      Pages 21-29

    4. MDDs are Efficient Modeling Tools: An Application to Some Statistical Constraints

      • Guillaume Perez, Jean-Charles Régin
      Pages 30-40

    5. On Finding the Optimal BDD Relaxation

      • David Bergman, Andre Augusto Cire
      Pages 41-50

    6. Design and Implementation of Bounded-Length Sequence Variables

      • Joseph D. Scott, Pierre Flener, Justin Pearson, Christian Schulte
      Pages 51-67

    7. In Search of Balance: The Challenge of Generating Balanced Latin Rectangles

      • Mateo Díaz, Ronan Le Bras, Carla Gomes
      Pages 68-76

    8. Debugging Unsatisfiable Constraint Models

      • Kevin Leo, Guido Tack
      Pages 77-93

    9. Learning Decision Trees with Flexible Constraints and Objectives Using Integer Optimization

      • Sicco Verwer, Yingqian Zhang
      Pages 94-103

    10. Relaxation Methods for Constrained Matrix Factorization Problems: Solving the Phase Mapping Problem in Materials Discovery

      • Junwen Bai, Johan Bjorck, Yexiang Xue, Santosh K. Suram, John Gregoire, Carla Gomes
      Pages 104-112

    11. Minimizing Landscape Resistance for Habitat Conservation

      • Diego de Uña, Graeme Gange, Peter Schachte, Peter J. Stuckey
      Pages 113-130

    12. A Hybrid Approach for Stator Winding Design Optimization

      • Alessandro Zanarini, Jan Poland
      Pages 131-146

    13. A Distributed Optimization Method for the Geographically Distributed Data Centres Problem

      • Mohamed Wahbi, Diarmuid Grimes, Deepak Mehta, Kenneth N. Brown, Barry O’Sullivan
      Pages 147-166

    14. Explanation-Based Weighted Degree

      • Emmanuel Hebrard, Mohamed Siala
      Pages 167-175

    15. Counting Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems

      • Antoine Delaite, Gilles Pesant
      Pages 176-184

    16. The Weighted Arborescence Constraint

      • Vinasetan Ratheil Houndji, Pierre Schaus, Mahouton Norbert Hounkonnou, Laurence Wolsey
      Pages 185-201

    17. Learning When to Use a Decomposition

      • Markus Kruber, Marco E. Lübbecke, Axel Parmentier
      Pages 202-210

    18. Experiments with Conflict Analysis in Mixed Integer Programming

      • Jakob Witzig, Timo Berthold, Stefan Heinz
      Pages 211-220

    19. A First Look at Picking Dual Variables for Maximizing Reduced Cost Fixing

      • Omid Sanei Bajgiran, Andre A. Cire, Louis-Martin Rousseau
      Pages 221-228
Back to top

Other volumes

  1. Integration of AI and OR Techniques in Constraint Programming

Keywords

About this book

This book constitutes the proceedings of the 14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2017, held in Padua, Italy, in June 2017.

The 32 full papers presented together with 6 abstracts were carefully reviewed and selected from numerous submissions. The conference brings together interested researchers from constraint programming, artificial intelligence, and operations research to present new techniques or applications in the intersection of these fields and provides an opportunity for researchers in one area to learn about techniques in the others, and to show how the integration of techniques from different fields can lead to interesting results on large and complex problems.

Editors and Affiliations

  • University of Padua, Padua, Italy

    Domenico Salvagnin

  • University of Bologna, Bologna, Italy

    Michele Lombardi

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation