Networks · 1983 · 140 citations · 3 references
Natural SciencesComputer ScienceAlgorithmsOptimizationCombinatorial EnumerationCombinatorial OptimizationConstrained OptimizationEnumerative CombinatoricsShortest Path AlgorithmsConstrained Shortest PathsDijkstra's AlgorithmEnumerative AlgorithmsShortest Path EnumerationShortest Path Problems
Abstract Certain properties of a shortest chain subject to several side constraints are established. Based on these an implicit enumeration algorithm, that is, a generalization of the one given by Dijkstra for the case without any side constraint, is presented. Validation of the algorithm and an illustrative example are included.
3
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
The constrained shortest path problem
Y.P. Aneja, K. P. K. Nair · Naval Research Logistics Quarterly · 1978 · 69 citations