An improved binary search algorithm for the Multiple-Choice Knapsack Problem (Q2954365): Difference between revisions

@@ Property / describes a project that uses @@
+Knapsack
@@ Property / describes a project that uses: Knapsack / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1051/ro/2015061
+Normal rank
@@ Property / OpenAlex ID @@
+W2540476875
@@ Property / OpenAlex ID: W2540476875 / rank @@
+Normal rank
@@ Property / cites work @@
+A computational study of a multiple-choice knapsack algorithm
+Normal rank
@@ Property / cites work @@
+A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
+Normal rank
@@ Property / cites work @@
+An approximate binary search algorithm for the multiple-choice knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+A Note on Approximation Schemes for Multidimensional Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Vector bin packing with multiple-choice
@@ Property / cites work: Vector bin packing with multiple-choice / rank @@
+Normal rank
@@ Property / cites work @@
+A minimal algorithm for the multiple-choice knapsack problem
+Normal rank