Approximate and exact algorithms for the fixed-charge knapsack problem (Q2572244): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2004.06.023
+Normal rank
@@ Property / OpenAlex ID @@
+W2026884285
@@ Property / OpenAlex ID: W2026884285 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms For The Setup Knapsack Problem
@@ Property / cites work: Exact Algorithms For The Setup Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3347319
@@ Property / cites work: Q3347319 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for solving the multiple-choice knapsack problem
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting Stock Problem—Part II
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+New trends in exact algorithms for the \(0-1\) knapsack problem
+Normal rank
@@ Property / cites work @@
+A Minimal Algorithm for the 0-1 Knapsack Problem
@@ Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the generalized assignment problem
+Normal rank