default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDConstraints, Volume 15
Volume 15, Number 1, January 2010
- Eugene C. Freuder, Robert Heffernan, Richard J. Wallace, Nic Wilson
:
Lexicographically-ordered constraint satisfaction problems. 1-28 - Radu Marinescu, Rina Dechter:
Evaluating the impact of AND/OR search on 0-1 integer linear programming. 29-63 - Barbara M. Smith, Jean-François Puget:
Constraint models for graceful graphs. 64-92 - Bertrand Neveu, Gilles Trombettoni, Gilles Chabert:
Improving inter-block backtracking with interval Newton. 93-116 - Serdar Kadioglu, Meinolf Sellmann:
Grammar constraints. 117-144 - Hadrien Cambazard, Barry O'Sullivan:
Erratum to "Reformulating table constraints using functional dependencies - an application to explanation generation". 145-147
Volume 15, Number 2, April 2010
- Peter J. Stuckey:
Introduction to the special issue on the Fourteenth International Conference on Principles and Practice of Constraint Programming (CP 2008). 149-150 - Tony Minoru Tamura Lopes, André A. Ciré, Cid Carvalho de Souza, Arnaldo Vieira Moura:
A hybrid model for a multiproduct pipeline planning and scheduling problem. 151-189 - Alexandre Goldsztejn, Laurent Granvilliers:
A new framework for sharp and efficient resolution of NCSP with manifolds of solutions. 190-212 - Jean-Marie Normand, Alexandre Goldsztejn, Marc Christie, Frédéric Benhamou:
A branch and bound algorithm for numerical Max-CSP. 213-237 - Hélène Collavizza, Michel Rueher, Pascal Van Hentenryck:
CPBPV: a constraint-programming framework for bounded program verification. 238-264 - Kenil C. K. Cheng, Roland H. C. Yap:
An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints. 265-304
Volume 15, Number 3, July 2010
- Gilles Pesant:
Editor's note. 305-306 - Peter J. Stuckey, Ralph Becket, Julien Fischer:
Philosophy of the MiniZinc challenge. 307-316 - Christophe Lecoutre, Olivier Roussel, Marc R. C. van Dongen:
Promoting robust black-box solvers through competitions. 317-326 - Stéphane Zampelli, Yves Deville, Christine Solnon:
Solving subgraph isomorphism problems with constraint programming. 327-353 - Yat Chiu Law, Jimmy Ho-Man Lee, May H. C. Woo:
Redundant modeling in permutation weighted constraint satisfaction problems. 354-403 - Ferenc Domes, Arnold Neumaier:
Constraint propagation on quadratic constraints. 404-429 - Stanislav Zivný, Peter G. Jeavons:
Classes of submodular constraints expressible by graph cuts. 430-452
Volume 15, Number 4, October 2010
- Pedro Meseguer, Francesca Rossi, Thomas Schiex:
Introduction to the special issue on Constraint-based approaches to Preference Modelling and Reasoning. 453-455 - Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes:
Resolution-based lower bounds in MaxSAT. 456-484 - Emanuele Di Rosa, Enrico Giunchiglia, Marco Maratea:
Solving satisfiability problems with preferences. 485-515 - Hélène Fargier, Emma Rollon, Nic Wilson:
Enabling local computation for partially ordered preferences. 516-539 - Nic Wilson, Diarmuid Grimes, Eugene C. Freuder:
Interleaving solving and elicitation of constraint satisfaction problems based on expected cost. 540-573 - Markus Zanker, Markus Jessenitschnig, Wolfgang Schmid:
Preference reasoning with soft constraints in constraint-based recommender systems. 574-595
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-15 19:22 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:
