Minmax linear knapsack problem with grouped variables and gub (Q3835625): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/02331939308843905
+Normal rank
@@ Property / OpenAlex ID @@
+W2050786034
@@ Property / OpenAlex ID: W2050786034 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+The Knapsack Sharing Problem
@@ Property / cites work: The Knapsack Sharing Problem / rank @@
+Normal rank
@@ Property / cites work @@
+AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints
+Normal rank
@@ Property / cites work @@
+A graphical method to solve a maximin allocation problem
+Normal rank
@@ Property / cites work @@
+An O(n) algorithm for the multiple-choice knapsack linear program
+Normal rank
@@ Property / cites work @@
+Continuous maximin knapsack problems with GLB constraints
+Normal rank
@@ Property / cites work @@
+A o(n logn) algorithm for LP knapsacks with GUB constraints
+Normal rank
@@ Property / cites work @@
+A note on the knapsack problem with special ordered sets
+Normal rank
@@ Property / cites work @@
+Q4729610
@@ Property / cites work: Q4729610 / rank @@
+Normal rank
@@ Property / cites work @@
+A graphical method to solve a family of allocation problems
+Normal rank
@@ Property / cites work @@
+An O(n) algorithm for the linear multiple choice knapsack problem and related problems
+Normal rank