A linear time algorithm for linearizing quadratic and higher-order shortest path problems
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
A linear time algorithm for linearizing quadratic and higher-order shortest path problems ; day:9 ; month:5 ; year:2024 ; pages:1-24
Mathematical programming ; (9.5.2024), 1-24
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10107-024-02086-z
- URN
-
urn:nbn:de:101:1-2407190809204.722050670403
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:01 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
- Çela, Eranda
- Klinz, Bettina
- Lendl, Stefan
- Woeginger, Gerhard J.
- Wulf, Lasse
- SpringerLink (Online service)
Other Objects (12)
Special cases of the quadratic shortest path problem
Acceleration of Shortest Path and Constrained Shortest Path Computation
A Fast Shortest Path Algorithm on Terrain-like Graphs
Shortest path problem using Bellman algorithm under neutrosophic environment
An all-pairs shortest path algorithm for bipartite graphs
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Dijkstra algorithm for shortest path problem under interval-valued Pythagorean fuzzy environment
A dynamic programming algorithm for solving the k-Color Shortest Path Problem
Special cases of the quadratic shortest path problem
Acceleration of Shortest Path and Constrained Shortest Path Computation
A Fast Shortest Path Algorithm on Terrain-like Graphs
Shortest path problem using Bellman algorithm under neutrosophic environment
An all-pairs shortest path algorithm for bipartite graphs
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Dijkstra algorithm for shortest path problem under interval-valued Pythagorean fuzzy environment
A dynamic programming algorithm for solving the k-Color Shortest Path Problem
Special cases of the quadratic shortest path problem
Acceleration of Shortest Path and Constrained Shortest Path Computation
A Fast Shortest Path Algorithm on Terrain-like Graphs
Shortest path problem using Bellman algorithm under neutrosophic environment
An all-pairs shortest path algorithm for bipartite graphs
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Dijkstra algorithm for shortest path problem under interval-valued Pythagorean fuzzy environment