- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Recoverable Robust Shortest Path Problems ; 2008, 34
Preprint Reihe Mathematik ; 2008, 34
- Classification
-
Mathematik
- Creator
-
Puhl, Christina
- DOI
-
10.14279/depositonce-14402
- Handle
-
11303/15629
- URN
-
urn:nbn:de:101:1-2021122201291600675448
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:37 AM CEST
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
- Puhl, Christina
Other Objects (12)
Shortest path network problems
Variants of the Shortest Path Problem
Acceleration of Shortest Path and Constrained Shortest Path Computation
On Non-Classical Stochastic Shortest Path Problems
Distributed shortest-path computation
Solving the robust shortest path problem with interval data using a probabilistic metaheuristic approach
Special cases of the quadratic shortest path problem
Algorithms for Time Dependent Bicriteria Shortest Path Problems
New Multiobjective Shortest Path Algorithms
Fitness Landscapes Based on Sorting and Shortest Path Problems
ANT COLONY OPTIMIZATION PARAMETER SELECTION FOR SHORTEST PATH PROBLEM
Shortest path problem using Bellman algorithm under neutrosophic environment
Shortest path network problems
Variants of the Shortest Path Problem
Acceleration of Shortest Path and Constrained Shortest Path Computation
On Non-Classical Stochastic Shortest Path Problems
Distributed shortest-path computation
Solving the robust shortest path problem with interval data using a probabilistic metaheuristic approach
Special cases of the quadratic shortest path problem
Algorithms for Time Dependent Bicriteria Shortest Path Problems
New Multiobjective Shortest Path Algorithms
Fitness Landscapes Based on Sorting and Shortest Path Problems
ANT COLONY OPTIMIZATION PARAMETER SELECTION FOR SHORTEST PATH PROBLEM
Shortest path problem using Bellman algorithm under neutrosophic environment
Shortest path network problems
Variants of the Shortest Path Problem
Acceleration of Shortest Path and Constrained Shortest Path Computation
On Non-Classical Stochastic Shortest Path Problems
Distributed shortest-path computation
Solving the robust shortest path problem with interval data using a probabilistic metaheuristic approach
Special cases of the quadratic shortest path problem
Algorithms for Time Dependent Bicriteria Shortest Path Problems
New Multiobjective Shortest Path Algorithms
Fitness Landscapes Based on Sorting and Shortest Path Problems
ANT COLONY OPTIMIZATION PARAMETER SELECTION FOR SHORTEST PATH PROBLEM