TU Darmstadt / ULB / TUprints

Browse by Person

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: No Grouping | Item Type | Date
Number of items: 1.

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. (Publisher's Version)
Darmstadt, DOI: 10.26083/tuprints-00019404,

This list was generated on Wed Feb 8 11:49:30 2023 CET.