2061 search results - page 3 / 413 » The continuous knapsack set |
WEA
2010
Springer
15 years 4 months ago
2010
Springer
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
ORL
2008
14 years 9 months ago
2008
DAM
2007
14 years 9 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
84
Voted
SAC
2009
ACM
15 years 4 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...
146
click to vote
CP
2009
Springer
15 years 10 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...