An exact algorithm for the budget-constrained multiple knapsack problem (Q2885555): Difference between revisions

@@ 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.1080/00207160.2011.608844
+Normal rank
@@ Property / OpenAlex ID @@
+W2103428370
@@ Property / OpenAlex ID: W2103428370 / rank @@
+Normal rank
@@ Property / cites work @@
+The Lagrangian Relaxation Method for Solving Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Partitions with Applications to the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Reduction Algorithm for Zero-One Single Knapsack Problems
+Normal rank
@@ Property / cites work @@
+An expanding-core algorithm for the exact \(0-1\) knapsack problem
+Normal rank
@@ Property / cites work @@
+An exact algorithm for large multiple knapsack problems
+Normal rank
@@ Property / cites work @@
+Q4350159
@@ Property / cites work: Q4350159 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4254875
@@ Property / cites work: Q4254875 / rank @@
+Normal rank