Counting Solutions of Knapsack Constraints (Q5387631): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-68155-7_17
+Normal rank
@@ Property / OpenAlex ID @@
+W1568747565
@@ Property / OpenAlex ID: W1568747565 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
+Normal rank
@@ Property / cites work @@
+A Class of Hard Small 0-1 Programs
@@ Property / cites work: A Class of Hard Small 0-1 Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2004
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2004
+Normal rank
@@ Property / cites work @@
+A dynamic programming approach for consistency and propagation for knapsack constraints
+Normal rank
@@ Property / cites work @@
+Solution Counting Algorithms for Constraint-Centered Search Heuristics
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5387631