Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Integration of Constraint Programming, Artificial Intelligence, and Operations Research

16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019, Proceedings

  • Conference proceedings
  • © 2019

Overview

Editors:
  1. Louis-Martin Rousseau

    1. Ecole Polytechnique de Montréal, Montréal, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Kostas Stergiou

    1. University of Western Macedonia, Kozani, Greece

    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 11494)

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

Included in the following conference series:

Conference proceedings info: CPAIOR 2019.

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

  1. Front Matter

    Pages i-xx
    Download chapter PDF

  2. Constraint Programming for Dynamic Symbolic Execution of JavaScript

    • Roberto Amadini, Mak Andrlon, Graeme Gange, Peter Schachte, Harald  Søndergaard, Peter J. Stuckey
    Pages 1-19

  3. Sequential and Parallel Solution-Biased Search for Subgraph Algorithms

    • Blair Archibald, Fraser Dunlop, Ruth Hoffmann, Ciaran McCreesh, Patrick Prosser, James Trimble
    Pages 20-38

  4. Core-Boosted Linear Search for Incomplete MaxSAT

    • Jeremias Berg, Emir Demirović, Peter J. Stuckey
    Pages 39-56

  5. Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation

    • David Bergman, Carlos Cardonha, Saharnaz Mehrani
    Pages 57-66

  6. Local Rapid Learning for Integer Programs

    • Timo Berthold, Peter J. Stuckey, Jakob Witzig
    Pages 67-83

  7. A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming

    • Jakob Witzig, Timo Berthold, Stefan Heinz
    Pages 84-94

  8. Generating Compound Moves in Local Search by Hybridisation with Complete Search

    • Gustav Björdal, Pierre Flener, Justin Pearson
    Pages 95-111

  9. SAT Encodings of Pseudo-Boolean Constraints with At-Most-One Relations

    • Miquel Bofill, Jordi Coll, Josep Suy, Mateu Villaret
    Pages 112-128

  10. A Constraint Programming Approach to Electric Vehicle Routing with Time Windows

    • Kyle E. C. Booth, J. Christopher Beck
    Pages 129-145

  11. A Sampling-Free Anticipatory Algorithm for the Kidney Exchange Problem

    • Danuta Sorina Chisca, Michele Lombardi, Michela Milano, Barry O’Sullivan
    Pages 146-162

  12. Evaluating Ising Processing Units with Integer Programming

    • Carleton Coffrin, Harsha Nagarajan, Russell Bent
    Pages 163-181

  13. Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems

    • Pierre Coste, Andrea Lodi, Gilles Pesant
    Pages 182-191

  14. A Counting-Based Approach to Scalable Micro-service Deployment

    • Waldemar Cruz, Fanghui Liu, Laurent Michel
    Pages 192-207

  15. An Optimization Approach to the Ordering Phase of an Attended Home Delivery Service

    • Günther Cwioro, Philipp Hungerländer, Kerstin Maier, Jörg Pöcher, Christian Truden
    Pages 208-224

  16. Consistency for 0–1 Programming

    • Danial Davarnia, J. N. Hooker
    Pages 225-240

  17. An Investigation into Prediction + Optimisation for the Knapsack Problem

    • Emir Demirović, Peter J. Stuckey, James Bailey, Jeffrey Chan, Chris Leckie, Kotagiri Ramamohanarao et al.
    Pages 241-257

  18. The Maximum Weighted Submatrix Coverage Problem: A CP Approach

    • Guillaume Derval, Vincent Branders, Pierre Dupont, Pierre Schaus
    Pages 258-274

  19. Learning MILP Resolution Outcomes Before Reaching Time-Limit

    • Martina Fischetti, Andrea Lodi, Giulia Zarpellon
    Pages 275-291

  20. An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem

    • Cristian Frăsinaru, Mădălina Răschip
    Pages 292-303
Back to top

Other volumes

  1. Integration of Constraint Programming, Artificial Intelligence, and Operations Research

Keywords

About this book

This book constitutes the proceedings of the 16th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2019, held in Thessaloniki, Greece, in June 2019.
The 34 full papers presented together with 9 short papers were carefully reviewed and selected from 94 submissions. The conference brings together interested researchers from Constraint Programming (CP), Artificial Intelligence (AI), and Operations Research (OR) to present new techniques or applications and to provide an opportunity for researchers in one area to learn about techniques in the others. A main objective of this conference series is also to give these researchers the opportunity to show how the integration of techniques from different fields can lead to interesting results on large and complex problems.

Editors and Affiliations

  • Ecole Polytechnique de Montréal, Montréal, Canada

    Louis-Martin Rousseau

  • University of Western Macedonia, Kozani, Greece

    Kostas Stergiou

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation