Sciweavers

2864 search results - page 119 / 573
» Constraint Programming in OPL
Sort
View
CP
2009
Springer
14 years 9 months ago
On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency
The length-lex representation for set variables orders all subsets of a given universe of values according to cardinality and lexicography. To achieve length-lex bounds consistency...
Meinolf Sellmann
CP
2005
Springer
14 years 2 months ago
Graph Invariants as Necessary Conditions for Global Constraints
Abstract. This article presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global c...
Nicolas Beldiceanu, Mats Carlsson, Jean-Xavier Ram...
CP
2005
Springer
14 years 2 months ago
Acquiring Parameters of Implied Global Constraints
This paper presents a technique for learning parameterized implied constraints. They can be added to a model to improve the solving process. Experiments on implied Gcc constraints ...
Christian Bessière, Remi Coletta, Thierry P...
CP
2003
Springer
14 years 2 months ago
Approximated Consistency for Knapsack Constraints
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
Meinolf Sellmann
POPL
2009
ACM
14 years 9 months ago
Relaxed memory models: an operational approach
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
Gérard Boudol, Gustavo Petri