Sciweavers

CP
2009
Springer
14 years 5 months ago
Generating Optimal Stowage Plans for Container Vessel Bays
Millions of containers are stowed every week with goods worth billions of dollars, but container vessel stowage is an all but neglected combinatorial optimization problem. In this ...
Alberto Delgado, Christian Schulte, Rune Mø...
CP
2009
Springer
14 years 5 months ago
Snake Lex: An Alternative to Double Lex
Andrew Grayland, Ian Miguel, Colva M. Roney-Dougal
CP
2009
Springer
14 years 5 months ago
Constraint-Based Graph Matching
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
Christine Solnon, Vianney le Clément, Yves ...
CP
2009
Springer
14 years 5 months ago
An Interpolation Method for CLP Traversal
We consider the problem of exploring the search tree of a CLP goal in pursuit of a target property. Essential to such a process is a method of tabling to prevent duplicate explorat...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
CP
2009
Springer
14 years 5 months ago
Search Spaces for Min-Perturbation Repair
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...
Alex S. Fukunaga
CP
2009
Springer
14 years 5 months ago
Restricted Global Grammar Constraints
We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disen...
George Katsirelos, Sebastian Maneth, Nina Narodyts...
CP
2009
Springer
14 years 5 months ago
Weakly Monotonic Propagators
Abstract. Today's models for propagation-based constraint solvers require propagators as implementations of constraints to be at least contracting and monotonic. These models ...
Christian Schulte, Guido Tack
CP
2009
Springer
14 years 5 months ago
Approximating Weighted Max-SAT Problems by Compensating for Relaxations
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...
Arthur Choi, Trevor Standley, Adnan Darwiche
CP
2009
Springer
14 years 5 months ago
Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
Mohammad M. Fazel-Zarandi, J. Christopher Beck
CP
2009
Springer
14 years 5 months ago
Failed Value Consistencies for Constraint Satisfaction
In constraint satisfaction, basic inferences rely on some properties of constraint networks, called consistencies, that allow the identification of inconsistent instantiations (als...
Christophe Lecoutre, Olivier Roussel