Solution of the zero-one multiple knapsack problem (Q1142701): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0377-2217(80)90112-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2031376842
@@ Property / OpenAlex ID: W2031376842 / rank @@
+Normal rank
@@ Property / cites work @@
+Merging and Sorting Applied to the Zero-One Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Dynamic Loading and Unloading of Liquids into Tanks
+Normal rank
@@ Property / cites work @@
+Computing Partitions with Applications to the Knapsack Problem
+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