Counting solutions of knapsack constraints

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

Volumn 5015 LNCS, Issue , 2008, Pages 203-217

  Pesant, Gilles ^a   Quimper, Claude Guy ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONSTRAINT THEORY; HEURISTIC ALGORITHMS; INFORMATION ANALYSIS;

BOUNDS CONSISTENT CONSTRAINT; KNAPSACK CONSTRAINTS; VARIABLE-VALUE PAIRS;

PROBLEM SOLVING;

EID: 44649119457     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68155-7_17     Document Type: Conference Paper

References (8)

1. Aardal, K., Hurkens, C.A. J., Lenstra, A.K.: Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables. Math. Op. Res. 25, 427-442 (2000)
2. Cornuéjols, G., Dawande, M.: A Class of Hard Small 0-1 Programs. INFORMS J. Computing 11, 205-210 (1999)
3. Pesant, G.: A Regular Language Membership Constraint for Finite Sequences of Variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 482-495. Springer, Heidelberg (2004)
4. Pesant, G.: Counting Solutions of CSPs: A Structural Approach. In: Proc. IJCAI 2005, pp. 260-265. Professional Book Center (2005)
5. Refalo, P.: Impact-Based Search Strategies for Constraint Programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557-571. Springer, Heidelberg (2004)
6. Trick, M.A.: A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints. Annals of Operations Research 118, 73-84 (2003)
7. Wassermann, A.: The Feasibility Version of the Market Split Problem (last consulted on November 10, 2007), http://did.mat.uni-bayreuth.de/~alfred/ marketsplit.html
8. Zanarini, A., Pesant, G.: Solution Counting Algorithms for Constraint-Centered Search Heuristics. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 743-757. Springer, Heidelberg (2007)