Some optimal path problems subject to improvements
From MaRDI portal
Publication:4157613
DOI10.1007/BF01917653zbMath0378.49020MaRDI QIDQ4157613
Publication date: 1978
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
49L99: Hamilton-Jacobi theories
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a routing problem
- Solutions of the Shortest-Route Problem—A Review
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- A Shortest Path Algorithm for Edge-Sparse Graphs
- A decomposition algorithm for shortest paths in a network with many strongly connected components
- A Decomposition Algorithm for the Shortest-Route Problem
- An Appraisal of Some Shortest-Path Algorithms
- The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph
- Some constrained shortest-route problems
- Algorithms for Obtaining Shortest Paths Visiting Specified Nodes