Propagating knapsack constraints in sublinear time

Authors:
Irit Katriel;Meinolf Sellmann;Eli Upfal;Pascal Van Hentenryck
Affiliations:
Brown University, Providence, RI;Brown University, Providence, RI;Brown University, Providence, RI;Brown University, Providence, RI
Venue:
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Year:
2007

Citing 1
Cited 4

Where are the hard knapsack problems?

Computers and Operations Research

Length-Lex Bounds Consistency for Knapsack Constraints

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Efficient context-free grammar constraints

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Grammar constraints

Constraints
The complexity of integer bound propagation

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 algorithm require a total of O(n log n+mk log(n/k)) time, where k ≤ n depends on the specific knapsack instance. We show that the expected value of k is significantly smaller than n on several interesting input distributions, hence while keeping the same worst-case complexity, on expectation the new algorithm is faster than the previously best method which runs in amortized linear time. After a theoretical study, we introduce heuristic enhancements and demonstrate the new algorithm's performance experimentally.