6 search results - page 1 / 2 » Length-lex bound consistency for knapsack constraints |
154
click to vote
CP
2009
Springer
15 years 11 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...
72
Voted
CP
2008
Springer
15 years 1 days 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...
69
Voted
AAAI
2008
15 years 17 days ago
2008
93
Voted
MP
2002
14 years 10 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...
86
Voted
SAC
2009
ACM
15 years 5 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...