2061 search results - page 3 / 413 » The continuous knapsack set |
WEA
2010
Springer
14 years 11 days 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
13 years 5 months ago
2008
DAM
2007
13 years 5 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...
SAC
2009
ACM
14 years 10 days 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...
CP
2009
Springer
14 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...