Journal: Constraints

Volume 18, Issue 4

471 -- 477Bart Demoen, Maria Garcia de la Banda. Redundant disequalities in the Latin Square problem
478 -- 534António Morgado, Federico Heras, Mark H. Liffiton, Jordi Planes, Joao Marques-Silva. Iterative and core-guided MaxSAT solving: A survey and assessment
535 -- 578Carlos Olarte, Camilo Rueda, Frank D. Valencia. Models and emerging trends of concurrent constraint programming
579 -- 608Marco Correia, Pedro Barahona. View-based propagation of decomposable constraints

Volume 18, Issue 3

307 -- 343Yat Chiu Law, Jimmy Ho-Man Lee, Toby Walsh, May H. C. Woo. Multiset variable representations and constraint propagation
344 -- 376Elsa Carvalho, Jorge Cruz, Pedro Barahona. Probabilistic constraints for nonlinear inverse problems - An ocean color remote sensing example
377 -- 403Yves Deville, Pascal Van Hentenryck, Jean-Baptiste Mairy. Domain consistency with forbidden values
404 -- 433Mohamed Wahbi, Redouane Ezzahir, Christian Bessiere, El-Houssine Bouyakhf. Nogood-based asynchronous forward checking algorithms
434 -- 469Cemalettin Öztürk, Semra Tunali, Brahim Hnich, Arslan M. Örnek. Balancing and scheduling of flexible mixed model assembly lines

Volume 18, Issue 2

141 -- 143Andrea Rendl, J. Christopher Beck. Introduction to the special issue on constraint modelling and reformulation
144 -- 165Roman Barták, Radomír Cernoch, Ondrej Kuzelka, Filip Zelezný. Formulating the template ILP consistency problem as a constraint satisfaction problem
166 -- 201Stefan Heinz, Jens Schulz, J. Christopher Beck. Using dual presolving reductions to reformulate cumulative constraints
202 -- 235Miquel Bofill, Dídac Busquets, Víctor Muñoz, Mateu Villaret. Reformulation based MaxSAT robustness
236 -- 268Carlos Ansótegui, Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret. Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
269 -- 305Tom Schrijvers, Guido Tack, Pieter Wuille, Horst Samulowitz, Peter J. Stuckey. Search combinators

Volume 18, Issue 1

1 -- 6Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson. On the reification of global constraints
7 -- 37Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu. On the hardness of solving edge matching puzzles as SAT or CSP problems
38 -- 74Gianluigi Greco, Francesco Scarcello. Structural tractability of enumerating CSP solutions
75 -- 107Christian Schulte, Guido Tack. View-based propagator derivation
108 -- 140Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson. On matrices, automata, and double counting in constraint programming