A heuristic routine for solving large loading problems (Q3962774): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/nav.3800260409
+Normal rank
@@ Property / OpenAlex ID @@
+W1509898203
@@ Property / OpenAlex ID: W1509898203 / rank @@
+Normal rank
@@ Property / cites work @@
+Merging and Sorting Applied to the Zero-One Knapsack Problem
+Normal rank
@@ Property / cites work @@
+An Additive Algorithm for Solving Linear Programs with Zero-One Variables
+Normal rank
@@ Property / cites work @@
+Discrete Programming by the Filter Method
@@ Property / cites work: Discrete Programming by the Filter Method / rank @@
+Normal rank
@@ Property / cites work @@
+The Loading Problem
@@ Property / cites work: The Loading Problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Implicit Enumeration Approach for Integer Programming
+Normal rank
@@ Property / cites work @@
+Surrogate Constraints
@@ Property / cites work: Surrogate Constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Surrogate Constraint Duality in Mathematical Programming
+Normal rank
@@ Property / cites work @@
+An algorithm for a class of loading problems
@@ Property / cites work: An algorithm for a class of loading problems / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for 0-1 multiple-knapsack problems
@@ Property / cites work: An algorithm for 0-1 multiple-knapsack problems / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Solution of 0-1 Loading Problems
+Normal rank
@@ Property / cites work @@
+An upper bound for the zero-one knapsack problem and a branch and bound algorithm
+Normal rank