On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency

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

• Type: Conference
• Year: 2009
• Where: CP
• Authors: Meinolf Sellmann
• Keywords: CP 2009, Programming Languages, Set Variables Orders, Sum Constraints