Length-lex bound consistency for knapsack constraints

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2009, Pages 1397-1401

  Yip, Justin ^a   Van Hentenryck, Pascal ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

Bound consistency; Knapsack; Length lex; Set variable

Indexed keywords

BOUND CONSISTENCY; CARDINALITIES; CONSTRAINT PROGRAMMING; KNAPSACK CONSTRAINTS; SET VARIABLES;

COMPUTER PROGRAMMING;

CONSTRAINT THEORY;

EID: 72949095425     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1529282.1529594     Document Type: Conference Paper

References (7)

1. Azevedo, F., Barahona, P. 2000. Modelling Digital Circuits Problems with Set Constraints. in CL-2000.
2. Malitsky, Y., Sellmann, M., Van Hoeve, W. 2008. Length-Lex Bounds Consistency for Knapsack Constraints. In Proc. CP'08.
3. Gervet, C. 1997. Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. In Constraints journal, volume 1(3). Kluwer.
4. Gervet, C., Van Hentenryck, P. 2006. Length-Lex Ordering for Set CSPs. In Proc. AAAI'06.
5. Puget, J-F. 1992. PECOS a High Level Constraint Programming Language In Proc. of Spicis.
6. Sadler, A., Gervet, C. 2007. Enhancing Set Constraint Solvers with Lexicographic Bounds. In Journal of Heuristics, 4(1), 2007.
7. Van Hentenryck, P., Yip, J., Gervet, C. and Dooms, G., 2008. Bound Consistency for Binary Length-Lex Set Constraints. In Proc. AAAI'08.