default search action
19th CP 2013: Uppsala, Sweden
- Christian Schulte:
Principles and Practice of Constraint Programming - 19th International Conference, CP 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings. Lecture Notes in Computer Science 8124, Springer 2013, ISBN 978-3-642-40626-3
Invited Talks
- Michela Milano:
Optimization for Policy Making: The Cornerstone for an Integrated Approach. 1-2 - Torsten Schaub:
Answer Set Programming: Boolean Constraint Solving for Knowledge Representation and Reasoning. 3-4 - Peter J. Stuckey:
Those Who Cannot Remember the Past Are Condemned to Repeat It. 5-6
Invited Public Lecture
- Pascal Van Hentenryck:
Decide Different! 7
Invited System Presentation
- Pascal Van Hentenryck, Laurent Michel:
The Objective-CP Optimization System. 8-29
Best Technical Track Paper
- Thierry Moisan, Jonathan Gaudreault, Claude-Guy Quimper:
Parallel Discrepancy-Based Search. 30-46
Best Application Track Paper
- Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Helmut Simonis:
Bin Packing with Linear Usage Costs - An Application to Energy Management in Data Centres. 47-62
Best Student Paper
- Jean-Guillaume Fages, Tanguy Lapègue:
Filtering AtMostNValue with Difference Constraints: Application to the Shift Minimisation Personnel Task Scheduling Problem. 63-79
Technical Track Papers
- Ignasi Abío, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell:
A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints. 80-96 - Ignasi Abío, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Peter J. Stuckey:
To Encode or to Propagate? The Best Choice for Each Constraint in SAT. 97-106 - Ozgur Akgun, Alan M. Frisch, Ian P. Gent, Bilal Syed Hussain, Christopher Jefferson, Lars Kotthoff, Ian Miguel, Peter Nightingale:
Automated Symmetry Breaking and Model Selection in Conjure. 107-116 - Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, Jordi Levy:
Improving WPM2 for (Weighted) Partial MaxSAT. 117-132 - Josep Argelich, Chu Min Li, Felip Manyà, Zhu Zhu:
MinSAT versus MaxSAT for Optimization Problems. 133-142 - Amine Balafrej, Christian Bessiere, Remi Coletta, El-Houssine Bouyakhf:
Adaptive Parameterized Consistency. 143-158 - Christian Bessiere, Hélène Fargier, Christophe Lecoutre:
Global Inverse Consistency for Interactive Constraint Satisfaction. 159-174 - Simon Brockbank, Gilles Pesant, Louis-Martin Rousseau:
Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems. 175-183 - Jakub Bulin, Dejan Delic, Marcel Jackson, Todd Niven:
On the Reduction of the CSP Dichotomy Conjecture to Digraphs. 184-199 - Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi:
A Scalable Approximate Model Counter. 200-216 - Geoffrey Chu, Peter J. Stuckey:
Dominance Driven Search. 217-229 - David A. Cohen, Peter G. Jeavons, Evgenij Thorstensen, Stanislav Zivný:
Tractable Combinations of Global Constraints. 230-246 - Jessica Davies, Fahiem Bacchus:
Postponing Optimization to Speed Up MAXSAT Solving. 247-262 - Simon de Givry, Steven D. Prestwich, Barry O'Sullivan:
Dead-End Elimination for Weighted CSP. 263-272 - Erin Delisle, Fahiem Bacchus:
Solving Weighted CSPs by Successive Relaxations. 273-281 - Gregory J. Duck, Joxan Jaffar, Nicolas C. H. Koh:
Constraint-Based Program Reasoning with Heaps and Separation. 282-298 - Daniel Fontaine, Laurent Michel, Pascal Van Hentenryck:
Model Combinators for Hybrid Optimization. 299-314 - Kathryn Francis, Jorge A. Navas, Peter J. Stuckey:
Modelling Destructive Assignments. 315-330 - Alex Fukunaga:
An Improved Search Algorithm for Min-Perturbation. 331-339 - Graeme Gange, Peter J. Stuckey, Pascal Van Hentenryck:
Explaining Propagators for Edge-Valued Decision Diagrams. 340-355 - Stefano Gualandi, Michele Lombardi:
A Simple and Effective Decomposition for the Multidimensional Binpacking Constraint. 356-364 - Patricia Gutierrez, Jimmy Ho-Man Lee, Ka Man Lei, Terrence W. K. Mak, Pedro Meseguer:
Maintaining Soft Arc Consistencies in BnB-ADOPT + during Search. 365-380 - Jun He, Pierre Flener, Justin Pearson, Weiming Zhang:
Solving String Constraints: The Case for Constraint Programming. 381-397 - Peter Jonsson, Victor Lagerkvist, Gustav Nordh:
Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction. 398-414 - William Klieber, Mikolás Janota, João Marques-Silva, Edmund M. Clarke:
Solving QBF with Free Variables. 415-431 - Kevin Leo, Christopher Mears, Guido Tack, Maria Garcia de la Banda:
Globalizing Constraint Models. 432-447 - Michele Lombardi, Stefano Gualandi:
A New Propagator for Two-Layer Neural Networks in Empirical Model Learning. 448-463 - Manuel Loth, Michèle Sebag, Youssef Hamadi, Marc Schoenauer:
Bandit-Based Search for Constraint Programming. 464-480 - Chuan Luo, Shaowei Cai, Wei Wu, Kaile Su:
Focused Random Walk with Configuration Checking and Break Minimum for Satisfiability. 481-496 - Radu Marinescu, Abdul Razak, Nic Wilson:
Multi-Objective Constraint Optimization with Tradeoffs. 497-512 - Michael D. Moffitt:
Multidimensional Bin Packing Revisited. 513-528 - Jean-Noël Monette, Nicolas Beldiceanu, Pierre Flener, Justin Pearson:
A Parametric Propagator for Discretely Convex Pairs of Sum Constraints. 529-544 - Nina Narodytska, Toby Walsh:
Breaking Symmetry with Different Orderings. 545-561 - Pierre Ouellet, Claude-Guy Quimper:
Time-Table Extended-Edge-Finding for the Cumulative Constraint. 562-577 - François Pelsser, Pierre Schaus, Jean-Charles Régin:
Revisiting the Cardinality Reasoning for BinPacking Constraint. 578-586 - Steven D. Prestwich, Marco Laumanns, Ban Kawas:
Value Interchangeability in Scenario Generation. 587-595 - Jean-Charles Régin, Mohamed Rezgui, Arnaud Malapert:
Embarrassingly Parallel Search. 596-610 - Pierre Schaus, Renaud Hartert:
Multi-Objective Large Neighborhood Search. 611-627 - Andreas Schutt, Thibaut Feydy, Peter J. Stuckey:
Scheduling Optional Tasks with Explanation. 628-644 - Paul Scott, Sylvie Thiébaux, Menkes van den Briel, Pascal Van Hentenryck:
Residential Demand Response under Uncertainty. 645-660 - Evgenij Thorstensen:
Lifting Structural Tractability to CSP with Global Constraints. 661-677 - Djamal Habet, Donia Toumi:
Empirical Study of the Behavior of Conflict Analysis in CDCL Solvers. 678-693 - Allen Van Gelder:
Primal and Dual Encoding from Applications into Quantified Boolean Formulas. 694-707 - Mohamed Wahbi, Redouane Ezzahir, Christian Bessiere:
Asynchronous Forward Bounding Revisited. 708-723 - Wei Xia, Roland H. C. Yap:
Optimizing STR Algorithms with Tuple Compression. 724-732
Application Track Papers
- Nicolas Beldiceanu, Georgiana Ifrim, Arnaud Lenoir, Helmut Simonis:
Describing and Generating Solutions for the EDF Unit Commitment Problem with the ModelSeeker. 733-748 - Quoc Trung Bui, Quang-Dung Pham, Yves Deville:
Solving the Agricultural Land Allocation Problem by Constraint-Based Local Search. 749-757 - Luca Di Gaspero, Andrea Rendl, Tommaso Urli:
Constraint-Based Approaches for Balancing Bike Sharing Systems. 758-773 - Alexandre Goldsztejn, Laurent Granvilliers, Christophe Jermann:
Constraint Based Computation of Periodic Orbits of Chaotic Dynamical Systems. 774-789 - Mikael Z. Lagerkvist, Martin Nordkvist, Magnus Rattfeldt:
Laser Cutting Path Planning Using CP. 790-804 - Martin Mann, Feras Nahar, Heinz Ekker, Rolf Backofen, Peter F. Stadler, Christoph Flamm:
Atom Mapping with Constraint Programming. 805-822 - M. A. Hakim Newton, Duc Nghia Pham, Wee Lum Tan, Marius Portmann, Abdul Sattar:
Stochastic Local Search Based Channel Assignment in Wireless Mesh Networks. 832-847 - Ana Paula Tomás, José Paulo Leal:
Automatic Generation and Delivery of Multiple-Choice Math Quizzes. 848-863 - Philippe Vismara, Remi Coletta, Gilles Trombettoni:
Constrained Wine Blending. 864-879 - Stéphane Zampelli, Yannis Vergados, Rowan Van Schaeren, Wout Dullaert, Birger Raa:
The Berth Allocation and Quay Crane Assignment Problem Using a CP Approach. 880-896
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.