Length-lex bound consistency for knapsack constraints

Authors:
Justin Yip;Pascal Van Hentenryck
Affiliations:
Brown University, Providence, RI;Brown University, Providence, RI
Venue:
Proceedings of the 2009 ACM symposium on Applied Computing
Year:
2009

Citing 3
Cited 2

Enhancing set constraint solvers with lexicographic bounds

Journal of Heuristics
Length-lex ordering for set CSPs

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Bound consistency for binary length-lex set constraints

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1

On decomposing Knapsack constraints for length-lex bounds consistency

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Evaluation of length-lex set variables

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The paper studies how to enforce bound consistency on a knapsack constraint over a set variable in this domain and proposes a bound-consistency algorithm which runs in O(c log n) time with a one-time preprocessing cost O(cn2) when the constraint is posted.