A fast algorithm for the linear multiple-choice knapsack problem (Q800227): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(84)90027-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2155737905
@@ Property / OpenAlex ID: W2155737905 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational power of pushdown automata
@@ Property / cites work: On the computational power of pushdown automata / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Large Zero-One Knapsack Problems
@@ Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n) algorithm for the multiple-choice knapsack linear program
+Normal rank
@@ Property / cites work @@
+The complexity of selection and ranking in X+Y and matrices with sorted columns
+Normal rank
@@ Property / cites work @@
+A note on the knapsack problem with special ordered sets
+Normal rank
@@ Property / cites work @@
+The Multiple-Choice Knapsack Problem
@@ Property / cites work: The Multiple-Choice Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Linear Multiple Choice Knapsack Problem
@@ Property / cites work: The Linear Multiple Choice Knapsack Problem / rank @@
+Normal rank