- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1862-4480
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
A dynamic programming algorithm for solving the k-Color Shortest Path Problem ; day:7 ; month:11 ; year:2020 ; pages:1-20
Optimization letters ; (7.11.2020), 1-20
- Creator
-
Ferone, Daniele
Festa, Paola
Fugaro, Serena
Pastore, Tommaso
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s11590-020-01659-z
- URN
-
urn:nbn:de:101:1-2020122015130867069744
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
2025-08-15T07:28:12+0200
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
- Ferone, Daniele
- Festa, Paola
- Fugaro, Serena
- Pastore, Tommaso
- SpringerLink (Online service)
Other Objects (12)
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Solving fuzzy multi-objective shortest path problem based on data envelopment analysis approach
Solving the robust shortest path problem with interval data using a probabilistic metaheuristic approach
Modified artificial bee colony algorithm for solving mixed interval-valued fuzzy shortest path problem
Variants of the Shortest Path Problem
Bellman–Ford algorithm for solving shortest path problem of a network under picture fuzzy environment
Shortest path embeddings of graphs on surfaces
The Shapley value for shortest path games
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Solving fuzzy multi-objective shortest path problem based on data envelopment analysis approach
Solving the robust shortest path problem with interval data using a probabilistic metaheuristic approach
Modified artificial bee colony algorithm for solving mixed interval-valued fuzzy shortest path problem
Variants of the Shortest Path Problem
Bellman–Ford algorithm for solving shortest path problem of a network under picture fuzzy environment
Shortest path embeddings of graphs on surfaces
The Shapley value for shortest path games
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Solving fuzzy multi-objective shortest path problem based on data envelopment analysis approach
Solving the robust shortest path problem with interval data using a probabilistic metaheuristic approach
Modified artificial bee colony algorithm for solving mixed interval-valued fuzzy shortest path problem
Variants of the Shortest Path Problem
Bellman–Ford algorithm for solving shortest path problem of a network under picture fuzzy environment
Shortest path embeddings of graphs on surfaces