Accepted Papers

Long Papers

Carleton Coffrin, Pascal Van Hentenryck and Russell Bent.
Spatial and Objective Decompositions for Very Large SCAPs

Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff Linderoth, Francois Margot and Andreas Waechter.
A probing algorithm for MINLPs with early detection of failures by SVM

Christian Bessiere, Nina Narodytska, Claude-Guy Quimper and Toby Walsh.
The AllDifferent Constraint with Precedences

K. Subramani and James Worthington.
A new algorithm for linear and integer feasibility in Horn constraints

Conrad Drescher, Markus Aschinger, Gerhard Friedrich, Georg Gottlob, Peter Jeavons, Anna Ryabokon and Evgenij Thorstensen.
Optimization Methods for the Partner Units Problem

David Bergman, Willem-Jan Van Hoeve and John Hooker.
Manipulating MDD Relaxations for Combinatorial Optimization

Petr Vilim.
Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources

Helmut Simonis and Barry O'Sullivan.
Almost Square Packing

Asma Lahimer, Pierre Lopez and Mohamed Haouari.
Climbing Depth-bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks

Jean-Charles Regin.
Using hard constraints for representing soft constraints

Alessio Bonfietti, Michele Lombardi, Michela Milano and Luca Benini.
Precedence Constraint Posting for Cyclic Scheduling Problems

Tim Januschowski and Marc E. Pfetsch.
Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry

Bistra Dilkina, Katherine Lai and Carla Gomes.
Upgrading Shortest Paths in Networks

Short Papers

Jean-Charles Regin and Thierry Petit.
The objective sum constraint

Alessandro Zanarini and Pascal Van Hentenryck.
Identifying Patterns in Sequences of Variables

Thanikesavan Sivanthi and Jan Poland.
Efficient Planning of Substation Automation System Cables

Nicolas Chapados, Marc Joliveau and Louis-Martin Rousseau.
Retail Store Workforce Scheduling by Expected Operating Income Maximization

Andrea Lodi, Gilles Pesant and Louis-Martin Rousseau.
On counting lattice points and Chvátal-Gomory cutting planes

Emrah B. Edis and Ceyda Oguz.
Parallel Machine Scheduling with Additional Resources: A Lagrangian-based Constraint Programming Approach

Gilles Pesant and Alessandro Zanarini.
Recovering Indirect Solution Densities for Counting-Based Branching Heuristics

Late Breaking Abstracts

Willem-Jan Van Hoeve, Marcel Hunting and Chris Kuip.
The Aimms Interface to Constraint Programming

Ranga Muhandiramge.
Exact Branch-and-price for Fair-share Airline Crew Rostering

Andrea Rendl, Matthias Prandtstetter and Jakob Puchinger.
Multimodal Home Healthcare Scheduling using a novel CP–VND–DP Approach

Tom Schrijvers, Guido Tack, Pieter Wuille, Horst Samulowitz and Peter Stuckey.
Search Combinators

Han Hoogeveen, Marjan Van Den Akker and Wouter Lauret.
Using column generation to solve the edge coloring problem

Stefan Heinz and Jens Schulz.
Explanation Algorithms for Cumulative Scheduling

Christian Artigues, Pierre Lopez and William Mangoua Sofack.
Satisfiability Test for the Energy Constraint

Mauro Birattari, Marco Chiarandini, Marco Saerens and Thomas Stuetzle.
Learning Graphical Models for Algorithm Configuration

Henno Vermeulen, Han Hoogeveen and Marjan Van Den Akker.
Solving the no-wait job shop problem: an ILP and CP approach

Arnaud Malapert, Louis-Martin Rousseau and Christelle Gué ret.
A Constraint Programming Approach for a Batch Processing Problem with Non-identical Job Sizes

Thiago Serra.
Towards a Characterization of Adaptiveness for Constraint Programming Search Design

Michele Lombardi and Michela Milano.
Neuron Constraints to Model Complex Real-World Problems

Jenny Nossack and Erwin Pesch.
Benders Decomposition for the Full-Truckload Pickup-and-Delivery Vehicle Routing Problem

Matteo Fischetti, Michele Monaci and Domenico Salvagnin.
Three ideas for the Quadratic Assignment Problem

Rahime Sancar Edis, Ceyda Oguz and Emrah B. Edis.
Comparing Integer Programming and Constraint Programming for a Flow Shop Lot Streaming Problem

Thorsten Koch and Yuji Shinano.
Which Mixed Integer Programs could a million CPUs solve?