Counting Solutions of Knapsack Constraints
From MaRDI portal
Publication:5387631
DOI10.1007/978-3-540-68155-7_17zbMath1142.68521OpenAlexW1568747565MaRDI QIDQ5387631
Gilles Pesant, Claude-Guy Quimper
Publication date: 27 May 2008
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68155-7_17
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
Faster integer-feasibility in mixed-integer linear programs by branching to force change ⋮ Counting and enumerating feasible rotating schedules by means of Gröbner bases ⋮ Solution counting algorithms for constraint-centered search heuristics
Cites Work
- A dynamic programming approach for consistency and propagation for knapsack constraints
- Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
- Solution Counting Algorithms for Constraint-Centered Search Heuristics
- A Class of Hard Small 0-1 Programs
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Counting Solutions of Knapsack Constraints
