16 search results - page 1 / 4 » The Practice of Approximated Consistency for Knapsack Constr... |
AAAI
2004
13 years 6 months ago
2004
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 algorith...
CP
2003
Springer
13 years 10 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...
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...
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...
DCC
2002
IEEE
14 years 4 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...