Length-lex bounds consistency for knapsack constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5202 LNCS, Issue , 2008, Pages 266-281

  Malitsky, Yuri ^a   Sellmann, Meinolf ^a   Van Hoeve, Willem Jan ^b  

^a Brown University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDS CONSISTENCIES; CARDINALITY; DO-MAINS; DOMAIN REPRESENTATIONS; FILTERING ALGORITHMS; KNAPSACK CONSTRAINTS; LEVELS OF CONSISTENCIES; POLYNOMIAL TIMES;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; POLYNOMIAL APPROXIMATION;

HEURISTIC ALGORITHMS;

EID: 56449103519     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85958-1_18     Document Type: Conference Paper

References (19)

1. Andersen, H.R., Hadzic, T., Hooker, J.N., Tiedemann, P.: A Constraint Store Based on Multivalued Decision Diagrams. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 118-132. Springer, Heidelberg (2007)
2. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press / McGraw-Hill (2001)
3. Dantzig, G.: Discrete variable extremum problems. Operations Research 5, 226-277 (1957)
4. Dooms, G., Mercier, L., Van Hentenryck, P., van Hoeve, W.-J., Michel, L.: Length-Lex Open Constraints. Technical Report CS-07-09, Brown University (2007)
5. Eremin, A., Wallace, M.: Hybrid Benders Decomposition Algorithms in Constraint Logic Programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 1-15. Springer, Heidelberg (2001)
6. Fahle, T., Sellmann, M.: Cost Based Filtering for the Constrained Knapsack Problem. Annals of Operations Research 115(1), 73-93 (2002)
7. Gervet, C.: Constraints over structured domains. In: Rossi, E, van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, ch. 17. Elsevier, Amsterdam (2006)
8. Gervet, C., Van Hentenryck, P.: Length-lex ordering for set CSPs. In: Proceedings of AAAI (2006)
9. Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Mathematical Programming 96(33-60), 22 (2003)
10. Ibarra, O.H., Kim, C.E.: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems. Journal of the ACM 22(4), 463-468 (1975)
11. Katriel, I., Sellmann, M., Upfal, E., Van Hentenryck, P.: Propagating Knapsack Constraints in Sublinear Time. In: Proceedings of AAAI. AAAI Press, Menlo Park (2007)
12. Pisinger, D.: Where are the hard knapsack problems? Computers and Operations Research 32, 2271-2282 (2005)
13. Sadler, A., Gervet, C.: Enhancing set constraint solvers with lexicographic bounds. Journal of Heuristics 14(1), 23-67 (2008)
14. Sellmann, M.: Approximated Consistency for Knapsack Constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 679-693. Springer, Heidelberg (2003)
15. Sellmann, M.: Cost-Based Filtering for Shorter Path Constraints. In: Rossi, F (ed.) CP 2003. LNCS, vol. 2833, pp. 694-708. Springer, Heidelberg (2003)
16. Sellmann, M.: The Practice of Approximated Consistency for Knapsack Constraints. In: Proceedings of AAAI, pp. 179-184. AAAI Press, Menlo Park (2004)
17. Sellmann, M., Fahle, T.: Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem. Annals of Operations Research 118(1), 17-33 (2003)
18. Sellmann, M., Kliewer, G., Koberstein, A.: Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 845-858. Springer, Heidelberg (2002)
19. Trick, M.A.: A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints. Annals of Operations Research 118(1), 73-84 (2003)