Counting Solutions of Knapsack Constraints (Q5387631): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Class of Hard Small 0-1 Programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A dynamic programming approach for consistency and propagation for knapsack constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solution Counting Algorithms for Constraint-Centered Search Heuristics / rank | |||
Normal rank |
Latest revision as of 09:53, 28 June 2024
scientific article; zbMATH DE number 5279321
Language | Label | Description | Also known as |
---|---|---|---|
English | Counting Solutions of Knapsack Constraints |
scientific article; zbMATH DE number 5279321 |
Statements
Counting Solutions of Knapsack Constraints (English)
0 references
27 May 2008
0 references
0 references
0 references