4 search results - page 1 / 1 » Filtering Bounded Knapsack Constraints in Expected Sublinear... |
AAAI
2010
13 years 7 months ago
2010
We present a highly efficient incremental algorithm for propagating bounded knapsack constraints. Our algorithm is based on the sublinear filtering algorithm for binary knapsack c...
AAAI
2007
13 years 7 months ago
2007
We develop an efficient incremental version of an existing cost-based filtering algorithm for the knapsack constraint. On a universe of n elements, m invocations of the algorith...
CP
2008
Springer
13 years 7 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
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that...