The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527): Difference between revisions

@@ Property / cites work @@
+The linking set problem: a polynomial special case of the multiple-choice knapsack problem
+Normal rank
@@ Property / cites work @@
+Optimizing constrained subtrees of trees
@@ Property / cites work: Optimizing constrained subtrees of trees / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition approach for a very large scale optimal diversity management problem
+Normal rank
@@ Property / cites work @@
+Comments on the note of Frieze
@@ Property / cites work: Comments on the note of Frieze / rank @@
+Normal rank
@@ Property / cites work @@
+The Optimal Diversity Management Problem
@@ Property / cites work: The Optimal Diversity Management Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum weight \(t\)-composition of an integer
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the linear multiple-choice knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4196269
@@ Property / cites work: Q4196269 / rank @@
+Normal rank
@@ Property / cites work @@
+A cost function property for plant location problems
+Normal rank
@@ Property / cites work @@
+Technical Note—A Branch-and-Bound Algorithm for Seeking the <i>P</i>-Median
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
+Normal rank
@@ Property / cites work @@
+A minimal algorithm for the multiple-choice knapsack problem
+Normal rank
@@ Property / cites work @@
+Solution methods for thep-median problem: An annotated bibliography
+Normal rank
@@ Property / cites work @@
+A pegging approach to the precedence-constrained knapsack problem
+Normal rank