Operations Research · 1975 · 30 citations · 4 references
ComputingIndustrial EngineeringCapacity PlanningOptimizationPath PlanningCombinatorial OptimizationNetwork Capacity PlanningNetwork Flow AlgorithmsRouting AlgorithmsShortest Path AlgorithmsTransportation ProblemsNetwork Flow ProblemsRouting ProblemsShortest Paths
The sequential decision problem considered in this paper consists of finding an optimal policy for increasing the capacity of a multi-terminal network with requirements increasing over a planning period and arcs subject to failure. This problem is formulated as a shortest-route problem in a very large network and solved by Dijkstra's algorithm. Computational experience is also presented.
4
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
An Appraisal of Some Shortest-Path Algorithms
Stuart E. Dreyfus · Operations Research · 1969 · 997 citations