Table of Contents

• Erratum to: Modeling Universal Instruction SelectionGabriel Hjort Blindell, Roberto Castañeda Lozano, Mats Carlsson, Christian Schulte. [doi]
• Encoding Linear Constraints with Implication Chains to CNFIgnasi Abío, Valentin Mayer-Eichberger, Peter J. Stuckey. 3-11 [doi]
• Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSPDavid Allouche, Simon de Givry, George Katsirelos, Thomas Schiex, Matthias Zytnicki. 12-29 [doi]
• Improved Constraint Propagation via Lagrangian DecompositionDavid Bergman, André Augusto Ciré, Willem Jan van Hoeve. 30-38 [doi]
• Strengthening Convex Relaxations with Bound Tightening for Power Network OptimizationCarleton Coffrin, Hassan L. Hijazi, Pascal Van Hentenryck. 39-57 [doi]
• Broken Triangles RevisitedMartin C. Cooper, Aymeric Duchein, Guillaume Escamocher. 58-73 [doi]
• A Microstructure-Based Family of Tractable Classes for CSPsMartin C. Cooper, Philippe Jégou, Cyril Terrioux. 74-88 [doi]
• The Unary Resource with Transition TimesCyrille Dejemeppe, Sascha Van Cauwelaert, Pierre Schaus. 89-104 [doi]
• A Global Constraint for a Tractable Class of Temporal Optimization ProblemsAlban Derrien, Jean-Guillaume Fages, Thierry Petit, Charles Prud'homme. 105-120 [doi]
• Exploiting GPUs in Solving (Distributed) Constraint Optimization Problems with Dynamic ProgrammingFerdinando Fioretto, Tiep Le, Enrico Pontelli, William Yeoh 0001, Tran Cao Son. 121-139 [doi]
• Conflict Ordering Search for Scheduling ProblemsSteven Gay, Renaud Hartert, Christophe Lecoutre, Pierre Schaus. 140-148 [doi]
• Simple and Scalable Time-Table Filtering for the Cumulative ConstraintSteven Gay, Renaud Hartert, Pierre Schaus. 149-157 [doi]
• General Bounding Mechanism for Constraint ProgramsMinh Hoang Ha, Claude-Guy Quimper, Louis-Martin Rousseau. 158-172 [doi]
• Smallest MUS Extraction with Minimal Hitting Set DualizationAlexey Ignatiev, Alessandro Previti, Mark H. Liffiton, Joao Marques-Silva. 173-182 [doi]
• Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPsPeter Jonsson, Victor Lagerkvist. 183-199 [doi]
• Generalized Totalizer Encoding for Pseudo-Boolean ConstraintsSaurabh Joshi 0001, Ruben Martins, Vasco M. Manquinho. 200-209 [doi]
• Smaller Selection Networks for Cardinality Constraints EncodingMichal Karpinski, Marek Piotrów. 210-225 [doi]
• PREFIX-PROJECTION Global Constraint for Sequential Pattern MiningAmina Kemmar, Samir Loudni, Yahia Lebbah, Patrice Boizumault, Thierry Charnois. 226-243 [doi]
• On Tree-Preserving ConstraintsShufeng Kong, Sanjiang Li, Yongming Li, Zhiguo Long. 244-261 [doi]
• Modeling and Solving Project Scheduling with CalendarsStefan Kreter, Andreas Schutt, Peter J. Stuckey. 262-278 [doi]
• Deterministic Estimation of the Expected Makespan of a POS Under Duration UncertaintyMichele Lombardi, Alessio Bonfietti, Michela Milano. 279-294 [doi]
• A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental GraphsCiaran McCreesh, Patrick Prosser. 295-312 [doi]
• Automated Auxiliary Variable Elimination Through On-the-Fly Propagator GenerationJean-Noël Monette, Pierre Flener, Justin Pearson. 313-329 [doi]
• Automatically Improving SAT Encoding of Constraint Problems Through Common Subexpression Elimination in Savile RowPeter Nightingale, Patrick Spracklen, Ian Miguel. 330-340 [doi]
• Exact Sampling for Regular and Markov Constraints with Belief PropagationAlexandre Papadopoulos, François Pachet, Pierre Roy, Jason Sakellariou. 341-350 [doi]
• Randomness as a ConstraintSteven David Prestwich, Roberto Rossi, S. Armagan Tarim. 351-366 [doi]
• Quasipolynomial Simulation of DNNF by a Non-determinstic Read-Once Branching ProgramIgor Razgon. 367-375 [doi]
• MiniSearch: A Solver-Independent Meta-Search Language for MiniZincAndrea Rendl, Tias Guns, Peter J. Stuckey, Guido Tack. 376-392 [doi]
• Two Clause Learning Approaches for Disjunctive SchedulingMohamed Siala 0002, Christian Artigues, Emmanuel Hebrard. 393-402 [doi]
• Bounding an Optimal Search Path with a Game of Cop and Robber on GraphsFrédéric Simard, Michael Morin, Claude-Guy Quimper, François Laviolette, Josée Desharnais. 403-418 [doi]
• Restricted Path Consistency RevisitedKostas Stergiou. 419-428 [doi]
• Machine Learning of Bayesian Networks Using Constraint ProgrammingPeter van Beek, Hella-Franziska Hoffmann. 429-445 [doi]
• Hybridization of Interval CP and Evolutionary Algorithms for Optimizing Difficult ProblemsCharlie Vanaret, Jean-Baptiste Gotteland, Nicolas Durand, Jean-Marc Alliot. 446-462 [doi]
• A General Framework for Reordering Agents Asynchronously in Distributed CSPMohamed Wahbi, Younes Mechqrane, Christian Bessiere, Kenneth N. Brown. 463-479 [doi]
• Automatically Generating Streamlined Constraint Models with Essence and ConjureJames Wetter, Özgür Akgün, Ian Miguel. 480-496 [doi]
• Constraint-Based Local Search for Finding Node-Disjoint Bounded-Paths in Optical Access NetworksAlejandro Arbelaez, Deepak Mehta, Barry O'Sullivan. 499-507 [doi]
• Open Packing for Facade-Layout Synthesis Under a General Purpose SolverAndrés Felipe Barco, Jean-Guillaume Fages, Élise Vareilles, Michel Aldanondo, Paul Gaborit. 508-523 [doi]
• Power Capping in High Performance Computing SystemsAndrea Borghesi, Francesca Collina, Michele Lombardi, Michela Milano, Luca Benini. 524-540 [doi]
• A Constraint-Based Approach to the Differential Harvest ProblemNicolas Briot, Christian Bessiere, Philippe Vismara. 541-556 [doi]
• Constrained Minimum Sum of Squares Clustering by Constraint ProgrammingThi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain. 557-573 [doi]
• A Constraint Programming Approach for Non-preemptive Evacuation SchedulingCaroline Even, Andreas Schutt, Pascal Van Hentenryck. 574-591 [doi]
• Solving Segment Routing Problems with Hybrid Constraint Programming TechniquesRenaud Hartert, Pierre Schaus, Stefano Vissicchio, Olivier Bonaventure. 592-608 [doi]
• Modeling Universal Instruction SelectionGabriel Hjort Blindell, Roberto Castañeda Lozano, Mats Carlsson, Christian Schulte. 609-626 [doi]
• Optimizing the Cloud Service Experience Using Constraint ProgrammingSerdar Kadioglu, Mike Colena, Steven Huberman, Claire Bagley. 627-637 [doi]
• Find Your Way Back: Mobility Profile Mining with ConstraintsLars Kotthoff, Mirco Nanni, Riccardo Guidotti, Barry O'Sullivan. 638-653 [doi]
• Joint Vehicle and Crew Routing and SchedulingEdward Lam, Pascal Van Hentenryck, Philip Kilby. 654-670 [doi]
• Constructing Sailing Match Race Schedules: Round-Robin Pairing ListsCraig Macdonald, Ciaran McCreesh, Alice Miller, Patrick Prosser. 671-686 [doi]
• Design and Evaluation of a Constraint-Based Energy Saving and Scheduling Recommender SystemSeán Óg Murphy, Oscar Manzano, Kenneth N. Brown. 687-703 [doi]
• Scheduling Running Modes of Satellite Instruments Using Constraint-Based Local SearchCédric Pralet, Solange Lemai-Chenevier, Jean Jaubert. 704-719 [doi]