Sciweavers

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

13

AAAI
2004

favoriteEmaildiscussreport

116views Intelligent Agents» more AAAI 2004»

The Practice of Approximated Consistency for Knapsack Constraints

13 years 6 months ago

The Practice of Approximated Consistency for Knapsack Constraints

Download www.cs.brown.edu

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 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

AAAI 2004 | Intelligent Agents | Knapsack Constraints | Knapsack Problem | Real-life Problem Formulations |

claim paper

Related Content

» Approximated Consistency for Knapsack Constraints

» LengthLex Bounds Consistency for Knapsack Constraints

» On Decomposing Knapsack Constraints for LengthLex Bounds Consistency

» Bit Allocation in Sublinear Time and the MultipleChoice Knapsack Problem

» On the Minimality and Decomposability of Constraint Networks

» Near optimal multiapplication allocation in shared sensor networks

» Light Algorithms for Maintaining MaxRPC During Search

» Approximate ModelBased Diagnosis Using PreferenceBased Compilation

» Global Synchronization in Sensornets

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2004
Where	AAAI
Authors	Meinolf Sellmann

Comments (0)