- Weitere Titel
-
Kompetitive Analyse des online Dial-a-Ride-Problems
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Darmstadt, Technische Universität Darmstadt, Dissertation, 2020
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Darmstadt
- (wer)
-
Universitäts- und Landesbibliothek Darmstadt
- (wann)
-
2020
- Urheber
- Beteiligte Personen und Organisationen
- URN
-
urn:nbn:de:tuda-tuprints-141341
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:43 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
- Birx, Alexander
- Disser, Yann
- Stougie, Leendert
- Universitäts- und Landesbibliothek Darmstadt
Entstanden
- 2020
Ähnliche Objekte (12)
Stability with uniform bounds for online dial-a-ride problems under reasonable load
Exact and Heuristic Methods for Dial-a-Ride Problems
A High-level Category Survey of Dial-a-Ride Problems
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
Hybrid search and the dial-a-ride problem with transfer scheduling constraints
Simulation and Evaluation of a Dial-A-Ride System in a Realistic Scenario
DIAL: Tretter, Kurt .- Dokumentationsfilm "DIAL"
Optimisation of value function approximation for solving dynamic dial-a-ride problems with shared-rides
Trust development in online competitive game environments: a network analysis approach
Taco, Ride, Captain, Ride
Competitive Algorithms for Multistage Online Scheduling
The competitive landscape of online platforms
Stability with uniform bounds for online dial-a-ride problems under reasonable load
Exact and Heuristic Methods for Dial-a-Ride Problems
A High-level Category Survey of Dial-a-Ride Problems
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
Hybrid search and the dial-a-ride problem with transfer scheduling constraints
Simulation and Evaluation of a Dial-A-Ride System in a Realistic Scenario
DIAL: Tretter, Kurt .- Dokumentationsfilm "DIAL"
Optimisation of value function approximation for solving dynamic dial-a-ride problems with shared-rides
Trust development in online competitive game environments: a network analysis approach
Taco, Ride, Captain, Ride
Competitive Algorithms for Multistage Online Scheduling
The competitive landscape of online platforms
Stability with uniform bounds for online dial-a-ride problems under reasonable load
Exact and Heuristic Methods for Dial-a-Ride Problems
A High-level Category Survey of Dial-a-Ride Problems
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
Hybrid search and the dial-a-ride problem with transfer scheduling constraints
Simulation and Evaluation of a Dial-A-Ride System in a Realistic Scenario
DIAL: Tretter, Kurt .- Dokumentationsfilm "DIAL"
Optimisation of value function approximation for solving dynamic dial-a-ride problems with shared-rides
Trust development in online competitive game environments: a network analysis approach
Taco, Ride, Captain, Ride
Competitive Algorithms for Multistage Online Scheduling