AAAI Publications, Twenty-Fourth AAAI Conference on Artificial Intelligence

Font Size: 
Filtering Bounded Knapsack Constraints in Expected Sublinear Time
Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek

Last modified: 2010-07-03

Abstract


We present a highly efficient incremental algorithm for propagating bounded knapsack constraints. Our algorithm is based on the sublinear filtering algorithm for binary knapsack constraints by Katriel et al. and achieves similar speed-ups of one to two orders of magnitude when compared with its linear-time counterpart. We also show that the representation of bounded knapsacks as binary knapsacks leads to ineffective filtering behavior. Experiments on standard knapsack benchmarks show that the new algorithm significantly outperforms existing methods for handling bounded knapsack constraints.

Full Text: PDF