A New Polynomially Bounded Shortest Path Algorithm
From MaRDI portal
Publication:3701214
DOI10.1287/opre.33.1.65zbMath0578.90089MaRDI QIDQ3701214
Fred Glover, Nancy V. Phillips, Darwin D. Klingman
Publication date: 1985
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.33.1.65
label setting algorithm; threshold algorithm; label correcting algorithms; partitioning shortest path; polynomially bounded shortest path algorithm
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
05C35: Extremal problems in graph theory
Related Items
Scheduling and routing algorithms for AGVs: A survey, Route planning for automated guided vehicles in a manufacturing facility, A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem, Maximum outflow in generalized flow networks, A new \(O(n^ 2)\) shortest chain algorithm, Microcomputer-based algorithms for large scale shortest path problems, A shortest augmenting path algorithm for dense and sparse linear assignment problems, Improvements for the thresh X2 shortest path algorithm, A note on the partitioning shortest path algorithm, A computational study of efficient shortest path algorithms, Shortest path algorithms: A computational study with the C programming language, Minisum amd minimax paths of a moving facility on a network, Some personal views on the current state and the future of locational analysis, Time depending shortest-path problems with applications to railway networks, Intelligent transportation systems -- Enabling technologies, Shortest paths algorithms: Theory and experimental evaluation, A new approximation algorithm for obtaining the probability distribution function for project completion time, Heuristic shortest path algorithms for transportation applications: state of the art, On the equivalence between some shortest path algorithms
