Iterative methods for determining the k shortest paths in a network
From MaRDI portal
Publication:4140002
DOI10.1002/net.3230060303zbMath0364.90105OpenAlexW2089957823MaRDI QIDQ4140002
Publication date: 1976
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230060303
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)
Related Items
The hierarchical network design problem, \(k\)-shortest routing of trains on shunting yards, CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL, The equity constrained shortest path problem, On bounds for the convergence of the SSOR method forH-matrices, A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem, Semirings and path spaces, Robust supply chain design under uncertain demand in agile manufacturing, Finding the k Shortest Paths, DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS, A framework for hierarchical interactive generation of cellular layout*, An algorithm for the ranking of shortest paths, A dynamic programming algorithm to find all solutions in a neighborhood of the optimum, Allowable processing orders in the accelerated cascade algorithm
Cites Work
