The 0-1 knapsack problem with multiple choice constraints (Q1248462): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4178782
@@ Property / cites work: Q4178782 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming Algorithms: A Framework and State-of-the-Art Survey
+Normal rank
@@ Property / cites work @@
+Reduction Algorithm for Zero-One Single Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Q3901292
@@ Property / cites work: Q3901292 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the generalized assignment problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0377-2217(78)90108-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2021895358
@@ Property / OpenAlex ID: W2021895358 / rank @@
+Normal rank