Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

34

CP
2003
Springer

favoriteEmaildiscussreport

84views Artificial Intelligence» more CP 2003»

Approximated Consistency for Knapsack Constraints

14 years 4 months ago

Approximated Consistency for Knapsack Constraints

Download www.aaai.org

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 ﬁltering algorithm for Knapsack constraints was published that is based on some previously developed approximation algorithms for the Knapsack problem. In this paper, we provide an empirical evaluation of approximated consistency for Knapsack constraints by applying it to the Market Split Problem and the Automatic Recording Problem.

Meinolf Sellmann

Real-time Traffic

CP 2003 | Knapsack Constraints | Knapsack Problem | Programming Languages | Real-life Problem Formulations |

claim paper

Related Content

» The Practice of Approximated Consistency for Knapsack Constraints

» LengthLex Bounds Consistency for Knapsack Constraints

» Lengthlex bound consistency for knapsack constraints

» On Decomposing Knapsack Constraints for LengthLex Bounds Consistency

» Counting Solutions of Knapsack Constraints

» Extending Dantzigs bound to the bounded multipleclass binary Knapsack problem

» Nonmonotone submodular maximization under matroid and knapsack constraints

» On the knapsack closure of 01 Integer Linear Programs

» Constant factor approximation algorithm for the knapsack median problem

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	CP
Authors	Meinolf Sellmann

Comments (0)