A new exact algorithm to solve the Multiple-Choice Multidimensional Knapsack Problem: The Utility Sorted Branch and Bound Algorithm
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Ereignis
-
Veröffentlichung
- (wo)
-
Darmstadt
- (wer)
-
Universitäts- und Landesbibliothek
- (wann)
-
2021
- DOI
-
10.26083/tuprints-00019404
- URN
-
urn:nbn:de:tuda-tuprints-194043
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:49 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Kreß, Antonio
- Kiel, Florian
- Metternich, Joachim
- Universitäts- und Landesbibliothek
Entstanden
- 2021
Ähnliche Objekte (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