Resolution of the 0–1 knapsack problem: Comparison of methods (Q4074670): Difference between revisions

@@ Property / cites work @@
+Discrete Programming by the Filter Method
@@ Property / cites work: Discrete Programming by the Filter Method / rank @@
+Normal rank
@@ Property / cites work @@
+Transformation of integer programs to knapsack problems
+Normal rank
@@ Property / cites work @@
+Q4053390
@@ Property / cites work: Q4053390 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming by Implicit Enumeration and Balas’ Method
+Normal rank
@@ Property / cites work @@
+An Improved Implicit Enumeration Approach for Integer Programming
+Normal rank
@@ Property / cites work @@
+A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
+Normal rank
@@ Property / cites work @@
+Surrogate Constraints
@@ Property / cites work: Surrogate Constraints / rank @@
+Normal rank
@@ Property / cites work @@
+A Branch Search Algorithm for the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+A Shrinking Boundary Algorithm for Discrete System Models
+Normal rank
@@ Property / cites work @@
+Integer Linear Programming: A Study in Computational Efficiency
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01580448
+Normal rank
@@ Property / OpenAlex ID @@
+W1989184333
@@ Property / OpenAlex ID: W1989184333 / rank @@
+Normal rank