6 search results - page 1 / 2 » Length-lex bound consistency for knapsack constraints |
CP
2009
Springer
14 years 5 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...
CP
2008
Springer
13 years 6 months ago
2008
Springer
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionall...
AAAI
2008
13 years 6 months ago
2008
MP
2002
13 years 4 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
SAC
2009
ACM
13 years 11 months ago
2009
ACM
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...