TU Darmstadt
ULB
TUprints
Browse by Person
Up a level |
Jump to: 2021
Number of items: 1.
2021
Kreß, Antonio ; Kiel, Florian ; Metternich, Joachim (2021)
A new exact algorithm to solve the Multiple-Choice Multidimensional Knapsack Problem: The Utility Sorted Branch and Bound Algorithm.
doi: 10.26083/tuprints-00019404
Report, Primary publication, Publisher's Version