- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Berlin, Freie Universität Berlin, Dissertation, 2024
- Schlagwort
-
Mehrkriterielle Optimierung
Kürzester-Weg-Problem
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Freie Universität Berlin
- (wann)
-
2023
- Urheber
- DOI
-
10.17169/refubium-43569
- URN
-
urn:nbn:de:kobv:188-refubium-43859-0
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:53 MESZ
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
- Maristany de las Casas, Pedro
- Freie Universität Berlin
Entstanden
- 2023
Ähnliche Objekte (12)
Engineering planar-separator and shortest-path algorithms
Hierarchical speed-up techniques for shortest-path algorithms
Algorithms for Time Dependent Bicriteria Shortest Path Problems
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path with acceleration constraints: complexity and approximation algorithms
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Output-sensitive complexity of multiobjective combinatorial optimization with an application to the multiobjective shortest path problem
Algorithms for Time-Dependent Bicriteria Shortest Path Problems : (revised version)
Shortest path network problems
Distributed shortest-path computation
Solving fuzzy multi-objective shortest path problem based on data envelopment analysis approach
Recoverable Robust Shortest Path Problems
Engineering planar-separator and shortest-path algorithms
Hierarchical speed-up techniques for shortest-path algorithms
Algorithms for Time Dependent Bicriteria Shortest Path Problems
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path with acceleration constraints: complexity and approximation algorithms
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Output-sensitive complexity of multiobjective combinatorial optimization with an application to the multiobjective shortest path problem
Algorithms for Time-Dependent Bicriteria Shortest Path Problems : (revised version)
Shortest path network problems
Distributed shortest-path computation
Solving fuzzy multi-objective shortest path problem based on data envelopment analysis approach
Recoverable Robust Shortest Path Problems
Engineering planar-separator and shortest-path algorithms
Hierarchical speed-up techniques for shortest-path algorithms
Algorithms for Time Dependent Bicriteria Shortest Path Problems
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path with acceleration constraints: complexity and approximation algorithms
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Output-sensitive complexity of multiobjective combinatorial optimization with an application to the multiobjective shortest path problem
Algorithms for Time-Dependent Bicriteria Shortest Path Problems : (revised version)
Shortest path network problems
Distributed shortest-path computation
Solving fuzzy multi-objective shortest path problem based on data envelopment analysis approach