Table of Contents

• Optimization for Policy Making: The Cornerstone for an Integrated ApproachMichela Milano. 1-2 [doi]
• Answer Set Programming: Boolean Constraint Solving for Knowledge Representation and ReasoningTorsten Schaub. 3-4 [doi]
• Those Who Cannot Remember the Past Are Condemned to Repeat ItPeter J. Stuckey. 5-6 [doi]
• Decide Different!Pascal Van Hentenryck. 7 [doi]
• The Objective-CP Optimization SystemPascal Van Hentenryck, Laurent Michel. 8-29 [doi]
• Parallel Discrepancy-Based SearchThierry Moisan, Jonathan Gaudreault, Claude-Guy Quimper. 30-46 [doi]
• Bin Packing with Linear Usage Costs - An Application to Energy Management in Data CentresHadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Helmut Simonis. 47-62 [doi]
• Filtering AtMostNValue with Difference Constraints: Application to the Shift Minimisation Personnel Task Scheduling ProblemJean-Guillaume Fages, Tanguy Lapègue. 63-79 [doi]
• A Parametric Approach for Smaller and Better Encodings of Cardinality ConstraintsIgnasi Abío, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell. 80-96 [doi]
• To Encode or to Propagate? The Best Choice for Each Constraint in SATIgnasi Abío, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Peter J. Stuckey. 97-106 [doi]
• Automated Symmetry Breaking and Model Selection in ConjureOzgur Akgun, Alan M. Frisch, Ian P. Gent, Bilal Syed Hussain, Christopher Jefferson, Lars Kotthoff, Ian Miguel, Peter Nightingale. 107-116 [doi]
• Improving WPM2 for (Weighted) Partial MaxSATCarlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, Jordi Levy. 117-132 [doi]
• MinSAT versus MaxSAT for Optimization ProblemsJosep Argelich, Chu Min Li, Felip Manyà, Zhu Zhu. 133-142 [doi]
• Adaptive Parameterized ConsistencyAmine Balafrej, Christian Bessiere, Remi Coletta, El-Houssine Bouyakhf. 143-158 [doi]
• Global Inverse Consistency for Interactive Constraint SatisfactionChristian Bessiere, Hélène Fargier, Christophe Lecoutre. 159-174 [doi]
• Counting Spanning Trees to Guide Search in Constrained Spanning Tree ProblemsSimon Brockbank, Gilles Pesant, Louis-Martin Rousseau. 175-183 [doi]
• On the Reduction of the CSP Dichotomy Conjecture to DigraphsJakub Bulin, Dejan Delic, Marcel Jackson, Todd Niven. 184-199 [doi]
• A Scalable Approximate Model CounterSupratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi. 200-216 [doi]
• Dominance Driven SearchGeoffrey Chu, Peter J. Stuckey. 217-229 [doi]
• Tractable Combinations of Global ConstraintsDavid A. Cohen, Peter G. Jeavons, Evgenij Thorstensen, Stanislav Zivny. 230-246 [doi]
• Postponing Optimization to Speed Up MAXSAT SolvingJessica Davies, Fahiem Bacchus. 247-262 [doi]
• Dead-End Elimination for Weighted CSPSimon de Givry, Steven D. Prestwich, Barry O'Sullivan. 263-272 [doi]
• Solving Weighted CSPs by Successive RelaxationsErin Delisle, Fahiem Bacchus. 273-281 [doi]
• Constraint-Based Program Reasoning with Heaps and SeparationGregory J. Duck, Joxan Jaffar, Nicolas C. H. Koh. 282-298 [doi]
• Model Combinators for Hybrid OptimizationDaniel Fontaine, Laurent Michel, Pascal Van Hentenryck. 299-314 [doi]
• Modelling Destructive AssignmentsKathryn Francis, Jorge A. Navas, Peter J. Stuckey. 315-330 [doi]
• An Improved Search Algorithm for Min-PerturbationAlex Fukunaga. 331-339 [doi]
• Explaining Propagators for Edge-Valued Decision DiagramsGraeme Gange, Peter J. Stuckey, Pascal Van Hentenryck. 340-355 [doi]
• A Simple and Effective Decomposition for the Multidimensional Binpacking ConstraintStefano Gualandi, Michele Lombardi. 356-364 [doi]
• Maintaining Soft Arc Consistencies in BnB-ADOPT + during SearchPatricia Gutierrez, Jimmy Ho-Man Lee, Ka Man Lei, Terrence W. K. Mak, Pedro Meseguer. 365-380 [doi]
• Solving String Constraints: The Case for Constraint ProgrammingJun He, Pierre Flener, Justin Pearson, Wei Ming Zhang. 381-397 [doi]
• Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint SatisfactionPeter Jonsson, Victor Lagerkvist, Gustav Nordh. 398-414 [doi]
• Solving QBF with Free VariablesWilliam Klieber, Mikolás Janota, Joao Marques-Silva, Edmund M. Clarke. 415-431 [doi]
• Globalizing Constraint ModelsKevin Leo, Christopher Mears, Guido Tack, Maria Garcia de la Banda. 432-447 [doi]
• A New Propagator for Two-Layer Neural Networks in Empirical Model LearningMichele Lombardi, Stefano Gualandi. 448-463 [doi]
• Bandit-Based Search for Constraint ProgrammingManuel Loth, Michèle Sebag, Youssef Hamadi, Marc Schoenauer. 464-480 [doi]
• Focused Random Walk with Configuration Checking and Break Minimum for SatisfiabilityChuan Luo, Shaowei Cai, Wei Wu, Kaile Su. 481-496 [doi]
• Multi-Objective Constraint Optimization with TradeoffsRadu Marinescu, Abdul Razak, Nic Wilson. 497-512 [doi]
• Multidimensional Bin Packing RevisitedMichael D. Moffitt. 513-528 [doi]
• A Parametric Propagator for Discretely Convex Pairs of Sum ConstraintsJean-Noël Monette, Nicolas Beldiceanu, Pierre Flener, Justin Pearson. 529-544 [doi]
• Breaking Symmetry with Different OrderingsNina Narodytska, Toby Walsh. 545-561 [doi]
• Time-Table Extended-Edge-Finding for the Cumulative ConstraintPierre Ouellet, Claude-Guy Quimper. 562-577 [doi]
• Revisiting the Cardinality Reasoning for BinPacking ConstraintFrançois Pelsser, Pierre Schaus, Jean-Charles Régin. 578-586 [doi]
• Value Interchangeability in Scenario GenerationSteven David Prestwich, Marco Laumanns, Ban Kawas. 587-595 [doi]
• Embarrassingly Parallel SearchJean-Charles Régin, Mohamed Rezgui, Arnaud Malapert. 596-610 [doi]
• Multi-Objective Large Neighborhood SearchPierre Schaus, Renaud Hartert. 611-627 [doi]
• Scheduling Optional Tasks with ExplanationAndreas Schutt, Thibaut Feydy, Peter J. Stuckey. 628-644 [doi]
• Residential Demand Response under UncertaintyPaul Scott, Sylvie Thiébaux, Menkes van den Briel, Pascal Van Hentenryck. 645-660 [doi]
• Lifting Structural Tractability to CSP with Global ConstraintsEvgenij Thorstensen. 661-677 [doi]
• Empirical Study of the Behavior of Conflict Analysis in CDCL SolversDjamal Habet, Donia Toumi. 678-693 [doi]
• Primal and Dual Encoding from Applications into Quantified Boolean FormulasAllen Van Gelder. 694-707 [doi]
• Asynchronous Forward Bounding RevisitedMohamed Wahbi, Redouane Ezzahir, Christian Bessiere. 708-723 [doi]
• Optimizing STR Algorithms with Tuple CompressionWei Xia, Roland H. C. Yap. 724-732 [doi]
• Describing and Generating Solutions for the EDF Unit Commitment Problem with the ModelSeekerNicolas Beldiceanu, Georgiana Ifrim, Arnaud Lenoir, Helmut Simonis. 733-748 [doi]
• Solving the Agricultural Land Allocation Problem by Constraint-Based Local SearchQuoc Trung Bui, Quang-Dung Pham, Yves Deville. 749-757 [doi]
• Constraint-Based Approaches for Balancing Bike Sharing SystemsLuca Di Gaspero, Andrea Rendl, Tommaso Urli. 758-773 [doi]
• Constraint Based Computation of Periodic Orbits of Chaotic Dynamical SystemsAlexandre Goldsztejn, Laurent Granvilliers, Christophe Jermann. 774-789 [doi]
• Laser Cutting Path Planning Using CPMikael Z. Lagerkvist, Martin Nordkvist, Magnus Rattfeldt. 790-804 [doi]
• Atom Mapping with Constraint ProgrammingMartin Mann, Feras Nahar, Heinz Ekker, Rolf Backofen, Peter F. Stadler, Christoph Flamm. 805-822 [doi]
• Beyond Feasibility: CP Usage in Constrained-Random Functional Hardware VerificationReuven Naveh, Amit Metodi. 823-831 [doi]
• Stochastic Local Search Based Channel Assignment in Wireless Mesh NetworksM. A. Hakim Newton, Duc Nghia Pham, Wee Lum Tan, Marius Portmann, Abdul Sattar. 832-847 [doi]
• Automatic Generation and Delivery of Multiple-Choice Math QuizzesAna Paula Tomás, José Paulo Leal. 848-863 [doi]
• Constrained Wine BlendingPhilippe Vismara, Remi Coletta, Gilles Trombettoni. 864-879 [doi]
• The Berth Allocation and Quay Crane Assignment Problem Using a CP ApproachStéphane Zampelli, Yannis Vergados, Rowan Van Schaeren, Wout Dullaert, Birger Raa. 880-896 [doi]