A Minimax Method for Finding the k Best “Differentiated” Paths
- 1 October 1997
- journal article
- Published by Wiley in Geographical Analysis
- Vol. 29 (4) , 298-313
- https://doi.org/10.1111/j.1538-4632.1997.tb00966.x
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- An efficient approach to solving the road network equilibrium traffic assignment problemPublished by Elsevier ,2002
- A strategic investment planning model for China's coal and electricity delivery systemEnergy, 1993
- A dual algorithm for the constrained shortest path problemNetworks, 1980
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a GraphJournal of the ACM, 1978
- Disjoint paths in a networkNetworks, 1974
- Optimal Network Problem: A Branch-and-Bound AlgorithmEnvironment and Planning A: Economy and Space, 1973
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959
- A Method for the Solution of the N th Best Path ProblemJournal of the ACM, 1959
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956
- ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH.Proceedings of the Institution of Civil Engineers, 1952