2864 search results - page 119 / 573 » Constraint Programming in OPL |
256
click to vote
CP
2009
Springer
16 years 6 months ago
2009
Springer
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...
151
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
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...
134
Voted
CP
2005
Springer
15 years 11 months ago
2005
Springer
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 ...
149
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
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...
310
click to vote
POPL
2009
ACM
16 years 6 months ago
2009
ACM
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...