default search action
Constraints - An International Journal, Volume 21
Volume 21, Number 1, January 2016
- Editor's note. 1
- Philip Kilby, Tommaso Urli:
Fleet design optimisation from historical data using constraint programming and large neighbourhood search. 2-21 - Nicolas Beldiceanu, Mats Carlsson, Rémi Douence, Helmut Simonis:
Using finite transducers for describing and synthesising structural time-series constraints. 22-40 - Alexander Ivrii, Sharad Malik, Kuldeep S. Meel, Moshe Y. Vardi:
On computing minimal independent support and its applications to sampling and counting. 41-58 - John N. Hooker:
Projection, consistency, and George Boole. 59-76 - Maxim Shishmarev, Christopher Mears, Guido Tack, Maria Garcia de la Banda:
Visual search tree profiling. 77-94 - Frédéric Koriche, Sylvain Lagrue, Éric Piette, Sébastien Tabary:
General game playing with stochastic CSP. 95-114
Volume 21, Number 2, April 2016
- Clément Carbonnel, Martin C. Cooper:
Tractability in constraint satisfaction problems: a survey. 115-144 - Jean-Guillaume Fages, Xavier Lorca, Louis-Martin Rousseau:
The salesman and the tree: the importance of search in CP. 145-162 - Anastasia Paparrizou, Kostas Stergiou:
Strong local consistency algorithms for table constraints. 163-197 - Evgenij Thorstensen:
Structural decompositions for problems with global constraints. 198-222 - Mark H. Liffiton, Alessandro Previti, Ammar Malik, João Marques-Silva:
Fast, flexible MUS enumeration. 223-250 - Faten Nabli, Thierry Martinez, François Fages, Sylvain Soliman:
On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity. 251-276 - Alexey Ignatiev, Mikolás Janota, João Marques-Silva:
Quantified maximum satisfiability. 277-302 - Amira Dems, Louis-Martin Rousseau, Jean-Marc Frayret:
A hybrid constraint programming approach to a wood procurement problem with bucking decisions. 303-317 - Luca Di Gaspero, Andrea Rendl, Tommaso Urli:
Balancing bike sharing systems with constraint programming. 318-348 - El Mehdi El Graoui, Imade Benelallam, El-Houssine Bouyakhf:
A commentary on "Hybrid search for minimal perturbation in Dynamic CSPs". 349-354
Volume 21, Number 3, July 2016
- Claude-Guy Quimper:
Introduction to the fast track issue for CPAIOR 2016. 355-356 - Avraham Itzhakov, Michael Codish:
Breaking symmetries in graph search with canonizing sets. 357-374 - Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller:
Computing the Ramsey number R(4, 3, 3) using abstraction and symmetry breaking. 375-393 - Edward Lam, Pascal Van Hentenryck:
A branch-and-price-and-check model for the vehicle routing problem with location congestion. 394-412 - Barry Hurley, Barry O'Sullivan, David Allouche, George Katsirelos, Thomas Schiex, Matthias Zytnicki, Simon de Givry:
Multi-language evaluation of exact solvers in graphical model discrete optimization. 413-434
Volume 21, Number 4, October 2016
- Michele Lombardi, Stefano Gualandi:
A lagrangian propagator for artificial neural networks in constraint programming. 435-462 - Milan Bankovic:
Extending SMT solvers with support for finite domain alldifferent constraint. 463-494 - Nina Narodytska, Thierry Petit, Mohamed Siala, Toby Walsh:
Three generalizations of the FOCUS constraint. 495-532 - David Bergman, André Augusto Ciré:
Theoretical insights and algorithmic tools for decision diagram-based optimization. 533-556 - Luc Jaulin:
Range-only SLAM with indistinguishable landmarks; a constraint programming approach. 557-576 - Jean Bertrand Gauthier, Antoine Legrain:
Operating room management under uncertainty. 577-596 - Philippe Vismara, Remi Coletta, Gilles Trombettoni:
Constrained global optimization for wine blending. 597-615 - Yossef Oren, Avishai Wool:
Side-channel cryptographic attacks using pseudo-boolean optimization. 616-645 - Chee Loong Soon, Wen-Yang Ku, J. Christopher Beck:
ℚ-bounds consistency for the spread constraint with variable mean. 646-652
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.