Sciweavers

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

34

CP
2009
Springer

favoriteEmaildiscussreport

140views Artificial Intelligence» more CP 2009»

On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency

14 years 5 months ago

On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency

Download www.cs.brown.edu

The length-lex representation for set variables orders all subsets of a given universe of values according to cardinality and lexicography. To achieve length-lex bounds consistency for Knapsack constraints it has been proposed to decompose the constraint into two sum constraints. We provide theoretical and practical evidence which shows that decomposition increases the problem of

Meinolf Sellmann

Real-time Traffic

CP 2009 | Programming Languages | Set Variables Orders | Sum Constraints |

claim paper

Related Content

» LengthLex Bounds Consistency for Knapsack Constraints

» Bound Consistency for Binary LengthLex Set Constraints

» Extending Dantzigs bound to the bounded multipleclass binary Knapsack problem

» Lengthlex bound consistency for knapsack constraints

» Counting Solutions of Knapsack Constraints

» A Translational Approach to Constraint Answer Set Solving

» Disjoint Partition and Intersection Constraints for Set and Multiset Variables

» Valuemaximizing deadline scheduling and its application to animation rendering

Post Info
More Details (n/a)

Added	22 Nov 2009
Updated	22 Nov 2009
Type	Conference
Year	2009
Where	CP
Authors	Meinolf Sellmann

Comments (0)