New Polynomial Shortest Path Algorithms and Their Computational Attributes

DOI10.1287/mnsc.31.9.1106zbMath0609.90103OpenAlexW1986602944MaRDI QIDQ3750535

Fred Glover, Robert F. Schneider, Darwin D. Klingman, Nancy V. Phillips

Publication date: 1985

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.31.9.1106

zbMATH Keywords

computational testingnear-sharp variantspolynomially bounded partitioning shortest pathsharp variants

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05)

Related Items

Experimentation in optimization, 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, Intelligent transportation systems -- Enabling technologies, A computational study of efficient shortest path algorithms, Least possible time paths in stochastic, time-varying networks., The equity constrained shortest path problem, A new \(O(n^ 2)\) shortest chain algorithm, Shortest path algorithms: A computational study with the C programming language, An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem, The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm, Microcomputer-based algorithms for large scale shortest path problems