Tutorials

• Willem-Jan van Hoeve. Constraint Programming with Decision Diagrams
• Warren Powell. Unifying the Jungle of Stochastic Optimization
• Michèle Sebag. Monte-Carlo Tree Search

Invited Talks

• Miguel Anjos. Optimization Challenges in Smart Grid Operations

Accepted Papers

CP Main Track

• Laurent Granvilliers. Adaptive Bisection of Numerical CSPs
• Thierry Petit. FOCUS: A Constraint for Concentrating High Costs
• Ignasi Abio and Peter Stuckey. Conflict Directed Lazy Decomposition
• Michał Wrona. Syntactically Characterizing Local-to-Global Consistency in ORD-Horn
• Geoffrey Chu and Peter Stuckey. Systematically Identifying and Exploiting Dominance Relations
• Geoffrey Chu and Peter Stuckey. Inter-problem Nogood Learning in Constraint Programming
• Arnaud Lallouet, Jimmy H.M. Lee and Terrence W.K. Mak. Consistencies for Ultra-Weak Solutions in Minimax Weighted CSPs Using the Duality Principle
• Matti Järvisalo, Arie Matsliah, Jakob Nordström and Stanislav Zivny. Relating Proof Complexity Measures and Practical Hardness of SAT
• Christophe Lecoutre, Nicolas Paris, Olivier Roussel and Sebastien Tabary. Propagating Soft Table Constraints
• Christian Bessiere, Patricia Gutierrez and Pedro Meseguer. Including Soft Global Constraints in DCOPs
• Arnaud Letort, Nicolas Beldiceanu and Mats Carlsson. A Scalable Sweep Algorithm for the cumulative Constraint
• Martin Cooper, Guillaume Escamocher and Stanislav Zivny. A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP
• Olivier Ponsini, Claude Michel and Michel Rueher. Refining abstract interpretation based value analysis with constraint programming techniques
• Mohamed Siala, Emmanuel Hebrard and Marie-José Huguet. An Optimal Arc Consistency Algorithm for a Chain of Atmost Constraints with Cardinality
• Weiming Liu and Sanjiang Li. Solving Minimal Constraint Networks in Qualitative Spatial and Temporal Reasoning
• Hannes Uppman. Max-Sur-CSP on Two Elements
• Xi Yun and Susan Epstein. A Hybrid Paradigm for Adaptive Parallel Search
• Jean-Baptiste Mairy, Pascal Van Hentenryck and Yves Deville. An Optimal Filtering Algorithm for Table Constraints
• Stefano Gualandi and Federico Malucelli. Resource Constrained Shortest Paths with Super Additive Objective Functions
• Emma Rollon and Javier Larrosa. Improved Bounded Max-Sum for Distributed Constraint Optimization
• Cédric Pralet and Gérard Verfaillie. Time-dependent Simple Temporal Networks
• Tenda Okimoto, Yongjoon Joe, Toshihiro Matsui, Katsutoshi Hirayama, Atsushi Iwasaki and Makoto Yokoo. Interactive Algorithm for Multi-objective Constraint Optimization
• Domenico Salvagnin and Toby Walsh. An hybrid MIP/CP approach for multi-activity shift scheduling
• Nicolas Beldiceanu and Helmut Simonis. A Model Seeker: Extracting Global Constraint Models From Positive Examples
• Jimmy Lee and Jingying Li. Increasing Symmetry Breaking by Preserving Target Symmetries
• Siert Wieringa. Understanding, improving and parallelizing MUS finding using model rotation
• George Katsirelos, Nina Narodytska and Toby Walsh. The SeqBin Constraint Revisited
• Laurent Simon and George Katsirelos. Eigenvector centrality in industrial SAT instances
• Laurent Simon and Gilles Audemard. Refining restarts strategies for SAT and UNSAT formulae
• Florent Madelaine and Barnaby Martin. Containment, Equivalence and Coreness from CSP to QCSP and beyond.
• Kathryn Francis, Sebastian Brand and Peter Stuckey. Optimisation Modelling for Software Developers
• Laurent Michel and Pascal Van Hentenryck. Constraint Satisfaction over Bit-Vectors
• Kenil Cheng, Wei Xia and Roland Yap. Space-Time Tradeoffs for the Regular Constraint
• Jean-Noël Monette, Pierre Flener and Justin Pearson. Towards Solver-Independent Propagators
• Tero Laitinen, Tommi Junttila and Ilkka Niemelä. Classifying and Propagating Parity Constraints
• Ignacio Castiñeiras, Milan De Cauwer and Barry O'Sullivan. Weibull-based Benchmarks for Bin Packing
• Alessio Bonfietti and Michele Lombardi. The Weighted Average Constraint
• Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs and Jordi Levy. Improving SAT-Based Weighted MaxSAT Solvers
• Philippe Vismara and Remi Coletta. Breaking variable symmetry in almost injective problems
• Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz and Meinolf Sellmann. Parallel SAT Solver Selection and Scheduling
• Alessandro Cimatti, Andrea Micheli and Marco Roveri. Solving Temporal Problems using SMT: Strong Controllability
• Chu-Min Li, Zhu Zhu, Felip Manya and Josep Argelich. A New Encoding from MinSAT into MaxSAT
• Mohammed Said Belaid, Claude Michel and Michel Rueher. Boosting local consistency algorithms over floating-point numbers
• Anton Belov, Mikoláš Janota, Ines Lynce and Joao Marques-Silva. On Computing Minimal Equivalent Subformulas
• Allen Van Gelder. Contributions to the Theory of Practical Quantified Boolean Formula Solving
• Robert Woodward, Shant Karakashian, Berthe Y Choueiry and Christian Bessiere. Revisiting Neighborhood Inverse Consistency on Binary CSPs
• Christophe Lecoutre, Olivier Roussel and Djamel Dehani. WCSP Integration of Soft Neighborhood Substitutability
• Vincent Armant, Laurent Simon and Philippe Dague. Distributed tree decomposition with privacy

Application

• Faten Nabli, François Fages, Thierry Martinez and Sylvain Soliman. A Boolean Model for Enumerating Minimal Siphons and Traps in Petri-nets (poster)
• Pierre Schaus and Jean-Charles Regin. A flow reasoning for bin-packing constraint. Application to a tank allocation problem
• Gilles Simonin, Christian Artigues, Emmanuel Hebrard and Pierre Lopez. Scheduling Scientific Experiments on the Rosetta/Philae Mission
• Hanyu Gu, Peter Stuckey and Mark Wallace. Maximising the Net Present Value of Large Resource-Constrained Projects
• Deepak Mehta, Barry O'Sullivan and Helmut Simonis. Comparing Solution Methods for the Machine Reassignment Problem
• Thiago Serra, Gilberto Nishioka and Fernando Marcellino. The Offshore Resources Scheduling Problem: Detailing a Constraint Programming Approach
• Roberto Castañeda Lozano, Mats Carlsson, Frej Drejhammar and Christian Schulte. Constraint-based Register Allocation and Instruction Scheduling
• Hadrien Cambazard and Bernard Penz. A Constraint Programming Approach for the Traveling Purchaser Problem

Multi-disciplinary

• Federico Campeotto, Agostino Dovier, Alessandro Dal Palù, Ferdinando Fioretto and Enrico Pontelli. A Filtering Technique for Fragment Assembly-based Proteins Loop Modeling with Constraints
• David Allouche, Seydou Traoré, Isabelle André, Simon de Givry, George Katsirelos, Sophie Barbe and Thomas Schiex. Computational Protein Design as a Cost Function Network Optimization Problem
• Santiago Ontañon and Pedro Meseguer. Feature Term Operations using Constraint Programming with Basic Variable Symmetry
• Stéphane Caro, Damien Chablat, Alexandre Goldsztejn, Daisuke Ishii and Christophe Jermann. A Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel Robots
• Jérôme Lang, Jérôme Mengin and Lirong Xia. Aggregating Conditionally Lexicographic Preferences on Multi-Issue Domains
• Alon Grubshtein and Amnon Meisels. Finding a Nash Equilibrium by Asynchronous Backtracking
• Georgiana Ifrim, Barry O'Sullivan and Helmut Simonis. Energy-Cost Forecasting for Scheduling
• Joao Guerra and Ines Lynce. Reasoning over Biological Networks using Maximum Satisfiability
• Andreas Distler, Tom Kelsey, Lars Kotthoff and Chris Jefferson. The Semigroups of Order 10
• Rolf Fagerberg, Christoph Flamm, Daniel Merkle and Philipp Peters. Exploring Chemistry Using SMT
• Pascal Germain, Sébastien Giguère, Jean-Francis Roy, Brice Zirakiza, François Laviolette and Claude-Guy Quimper. A Pseudo-Boolean Set Covering Machine
• Michael Morin, Anika-Pascale Papillon, Irène Abi-Zeid, François Laviolette and Claude-Guy Quimper. Constraint Programming for Path Planning with Uncertainty: Solving the Optimal Search Path problem