A new exact algorithm to solve the Multiple-Choice Multidimensional Knapsack Problem: The Utility Sorted Branch and Bound Algorithm
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Event
-
Veröffentlichung
- (where)
-
Darmstadt
- (who)
-
Universitäts- und Landesbibliothek
- (when)
-
2021
- DOI
-
10.26083/tuprints-00019404
- URN
-
urn:nbn:de:tuda-tuprints-194043
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:49 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Kreß, Antonio
- Kiel, Florian
- Metternich, Joachim
- Universitäts- und Landesbibliothek
Time of origin
- 2021
Other Objects (12)
A scalable parallel sorting algorithm using exact splitting
A competitive exact algorithm for assembly line balancing
Modifying the Douglas-Rachford algorithm to solve best approximation problems
A polynomial linear search algorithm for the N-dimensional Knapsack problem
A genetic algorithm for the twodimensional Knapsack problem with rectangular pieces
A polynomial linear search algorithm for the N-dimensional Knapsack problem
QuateXelero : an accelerated exact network motif detection algorithm
An exact algorithm for solving difficult detailed routing problems
Improved differential evolution algorithm to solve the advertising method selection problem
A polynomial algorithm for a NP-hard to solve optimization problem
An exact algorithm for the vehicle and crew scheduling problem
An Optimal Algorithm for Online Multiple Knapsack: Q/A Session A - Paper A2.B
A scalable parallel sorting algorithm using exact splitting
A competitive exact algorithm for assembly line balancing
Modifying the Douglas-Rachford algorithm to solve best approximation problems
A polynomial linear search algorithm for the N-dimensional Knapsack problem
A genetic algorithm for the twodimensional Knapsack problem with rectangular pieces
A polynomial linear search algorithm for the N-dimensional Knapsack problem
QuateXelero : an accelerated exact network motif detection algorithm
An exact algorithm for solving difficult detailed routing problems
Improved differential evolution algorithm to solve the advertising method selection problem
A polynomial algorithm for a NP-hard to solve optimization problem
An exact algorithm for the vehicle and crew scheduling problem
An Optimal Algorithm for Online Multiple Knapsack: Q/A Session A - Paper A2.B
A scalable parallel sorting algorithm using exact splitting
A competitive exact algorithm for assembly line balancing
Modifying the Douglas-Rachford algorithm to solve best approximation problems
A polynomial linear search algorithm for the N-dimensional Knapsack problem
A genetic algorithm for the twodimensional Knapsack problem with rectangular pieces
A polynomial linear search algorithm for the N-dimensional Knapsack problem
QuateXelero : an accelerated exact network motif detection algorithm
An exact algorithm for solving difficult detailed routing problems
Improved differential evolution algorithm to solve the advertising method selection problem
A polynomial algorithm for a NP-hard to solve optimization problem
An exact algorithm for the vehicle and crew scheduling problem