AAAI
2004
14 years 26 days 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...
AAAI
2010
14 years 27 days 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...
CP
2003
Springer
14 years 4 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...
STOC
2009
ACM
15 years 1 days ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...