default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st CP 2015: Cork, Ireland
- Gilles Pesant:
Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Cork, Ireland, August 31 - September 4, 2015, Proceedings. Lecture Notes in Computer Science 9255, Springer 2015, ISBN 978-3-319-23218-8
Technical Track
- Ignasi Abío, Valentin Mayer-Eichberger, Peter J. Stuckey:
Encoding Linear Constraints with Implication Chains to CNF. 3-11 - David Allouche, Simon de Givry, George Katsirelos, Thomas Schiex, Matthias Zytnicki:
Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP. 12-29 - David Bergman, André Augusto Ciré, Willem-Jan van Hoeve:
Improved Constraint Propagation via Lagrangian Decomposition. 30-38 - Carleton Coffrin, Hassan L. Hijazi
, Pascal Van Hentenryck:
Strengthening Convex Relaxations with Bound Tightening for Power Network Optimization. 39-57 - Martin C. Cooper, Aymeric Duchein, Guillaume Escamocher:
Broken Triangles Revisited. 58-73 - Martin C. Cooper, Philippe Jégou, Cyril Terrioux:
A Microstructure-Based Family of Tractable Classes for CSPs. 74-88 - Cyrille Dejemeppe, Sascha Van Cauwelaert, Pierre Schaus:
The Unary Resource with Transition Times. 89-104 - Alban Derrien, Jean-Guillaume Fages, Thierry Petit, Charles Prud'homme:
A Global Constraint for a Tractable Class of Temporal Optimization Problems. 105-120 - Ferdinando Fioretto, Tiep Le, Enrico Pontelli, William Yeoh, Tran Cao Son:
Exploiting GPUs in Solving (Distributed) Constraint Optimization Problems with Dynamic Programming. 121-139 - Steven Gay, Renaud Hartert, Christophe Lecoutre, Pierre Schaus:
Conflict Ordering Search for Scheduling Problems. 140-148 - Steven Gay, Renaud Hartert, Pierre Schaus:
Simple and Scalable Time-Table Filtering for the Cumulative Constraint. 149-157 - Minh Hoàng Hà, Claude-Guy Quimper, Louis-Martin Rousseau:
General Bounding Mechanism for Constraint Programs. 158-172 - Alexey Ignatiev, Alessandro Previti, Mark H. Liffiton, João Marques-Silva:
Smallest MUS Extraction with Minimal Hitting Set Dualization. 173-182 - Peter Jonsson, Victor Lagerkvist:
Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs. 183-199 - Saurabh Joshi, Ruben Martins, Vasco Manquinho:
Generalized Totalizer Encoding for Pseudo-Boolean Constraints. 200-209 - Michal Karpinski, Marek Piotrów:
Smaller Selection Networks for Cardinality Constraints Encoding. 210-225 - Amina Kemmar, Samir Loudni, Yahia Lebbah, Patrice Boizumault, Thierry Charnois:
PREFIX-PROJECTION Global Constraint for Sequential Pattern Mining. 226-243 - Shufeng Kong, Sanjiang Li, Yongming Li, Zhiguo Long:
On Tree-Preserving Constraints. 244-261 - Stefan Kreter, Andreas Schutt, Peter J. Stuckey:
Modeling and Solving Project Scheduling with Calendars. 262-278 - Michele Lombardi, Alessio Bonfietti, Michela Milano:
Deterministic Estimation of the Expected Makespan of a POS Under Duration Uncertainty. 279-294 - Ciaran McCreesh, Patrick Prosser:
A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs. 295-312 - Jean-Noël Monette, Pierre Flener, Justin Pearson:
Automated Auxiliary Variable Elimination Through On-the-Fly Propagator Generation. 313-329 - Peter Nightingale, Patrick Spracklen, Ian Miguel:
Automatically Improving SAT Encoding of Constraint Problems Through Common Subexpression Elimination in Savile Row. 330-340 - Alexandre Papadopoulos, François Pachet, Pierre Roy, Jason Sakellariou:
Exact Sampling for Regular and Markov Constraints with Belief Propagation. 341-350 - Steven D. Prestwich, Roberto Rossi, S. Armagan Tarim:
Randomness as a Constraint. 351-366 - Igor Razgon:
Quasipolynomial Simulation of DNNF by a Non-determinstic Read-Once Branching Program. 367-375 - Andrea Rendl, Tias Guns, Peter J. Stuckey, Guido Tack:
MiniSearch: A Solver-Independent Meta-Search Language for MiniZinc. 376-392 - Mohamed Siala, Christian Artigues, Emmanuel Hebrard:
Two Clause Learning Approaches for Disjunctive Scheduling. 393-402 - Frédéric Simard, Michael Morin, Claude-Guy Quimper, François Laviolette, Josée Desharnais:
Bounding an Optimal Search Path with a Game of Cop and Robber on Graphs. 403-418 - Kostas Stergiou:
Restricted Path Consistency Revisited. 419-428 - Peter van Beek, Hella-Franziska Hoffmann:
Machine Learning of Bayesian Networks Using Constraint Programming. 429-445 - Charlie Vanaret, Jean-Baptiste Gotteland, Nicolas Durand, Jean-Marc Alliot:
Hybridization of Interval CP and Evolutionary Algorithms for Optimizing Difficult Problems. 446-462 - Mohamed Wahbi, Younes Mechqrane, Christian Bessiere, Kenneth N. Brown:
A General Framework for Reordering Agents Asynchronously in Distributed CSP. 463-479 - James Wetter, Özgür Akgün, Ian Miguel:
Automatically Generating Streamlined Constraint Models with Essence and Conjure. 480-496
Application Track
- Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan:
Constraint-Based Local Search for Finding Node-Disjoint Bounded-Paths in Optical Access Networks. 499-507 - Andrés Felipe Barco, Jean-Guillaume Fages, Élise Vareilles, Michel Aldanondo, Paul Gaborit:
Open Packing for Facade-Layout Synthesis Under a General Purpose Solver. 508-523 - Andrea Borghesi, Francesca Collina, Michele Lombardi, Michela Milano, Luca Benini:
Power Capping in High Performance Computing Systems. 524-540 - Nicolas Briot, Christian Bessiere, Philippe Vismara:
A Constraint-Based Approach to the Differential Harvest Problem. 541-556 - Thi-Bich-Hanh Dao, Khanh-Chuong Duong, Christel Vrain:
Constrained Minimum Sum of Squares Clustering by Constraint Programming. 557-573 - Caroline Even, Andreas Schutt, Pascal Van Hentenryck:
A Constraint Programming Approach for Non-preemptive Evacuation Scheduling. 574-591 - Renaud Hartert, Pierre Schaus, Stefano Vissicchio, Olivier Bonaventure:
Solving Segment Routing Problems with Hybrid Constraint Programming Techniques. 592-608 - Gabriel Hjort Blindell, Roberto Castañeda Lozano, Mats Carlsson, Christian Schulte:
Modeling Universal Instruction Selection. 609-626 - Serdar Kadioglu, Mike Colena, Steven Huberman, Claire Bagley:
Optimizing the Cloud Service Experience Using Constraint Programming. 627-637 - Lars Kotthoff, Mirco Nanni, Riccardo Guidotti, Barry O'Sullivan:
Find Your Way Back: Mobility Profile Mining with Constraints. 638-653 - Edward Lam, Pascal Van Hentenryck, Philip Kilby:
Joint Vehicle and Crew Routing and Scheduling. 654-670 - Craig Macdonald, Ciaran McCreesh, Alice Miller, Patrick Prosser:
Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists. 671-686 - Seán Óg Murphy, Oscar Manzano, Kenneth N. Brown:
Design and Evaluation of a Constraint-Based Energy Saving and Scheduling Recommender System. 687-703 - Cédric Pralet, Solange Lemai-Chenevier, Jean Jaubert:
Scheduling Running Modes of Satellite Instruments Using Constraint-Based Local Search. 704-719
Erratum
- Gabriel Hjort Blindell, Roberto Castañeda Lozano, Mats Carlsson, Christian Schulte:
Erratum to: Modeling Universal Instruction Selection.
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.
last updated on 2024-11-11 21:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
