New Polynomial Shortest Path Algorithms and Their Computational Attributes
From MaRDI portal
Publication:3750535
DOI10.1287/mnsc.31.9.1106zbMath0609.90103MaRDI QIDQ3750535
Fred Glover, Robert F. Schneider, Nancy V. Phillips, Darwin D. Klingman
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
computational testing; near-sharp variants; polynomially bounded partitioning shortest path; sharp variants
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
05C35: Extremal problems in graph theory
65K05: Numerical mathematical programming methods
Related Items
The equity constrained shortest path problem, A new \(O(n^ 2)\) shortest chain algorithm, Microcomputer-based algorithms for large scale shortest path problems, 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, A computational study of efficient shortest path algorithms, 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, Least possible time paths in stochastic, time-varying networks., Intelligent transportation systems -- Enabling technologies
