A Multiple Pairs Shortest Path Algorithm
Author
Abstract
Suggested Citation
DOI: 10.1287/trsc.1050.0124
Download full text from publisher
References listed on IDEAS
- Donald Goldfarb & Zhiying Jin, 1999. "An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem," Operations Research, INFORMS, vol. 47(3), pages 445-448, June.
- G. Mills, 1966. "A Decomposition Algorithm for the Shortest-Route Problem," Operations Research, INFORMS, vol. 14(2), pages 279-291, April.
- Harry M. Markowitz, 1957. "The Elimination form of the Inverse and its Application to Linear Programming," Management Science, INFORMS, vol. 3(3), pages 255-269, April.
- T. C. Hu, 1968. "A Decomposition Algorithm for Shortest Paths in a Network," Operations Research, INFORMS, vol. 16(1), pages 91-102, February.
- Donald Goldfarb & Jianxiu Hao & Sheng-Roan Kai, 1990. "Efficient Shortest Path Simplex Algorithms," Operations Research, INFORMS, vol. 38(4), pages 624-628, August.
- George B. Dantzig, 1960. "On the Shortest Route Through a Network," Management Science, INFORMS, vol. 6(2), pages 187-190, January.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Rosenthal, Edward C., 2017. "A cooperative game approach to cost allocation in a rapid-transit network," Transportation Research Part B: Methodological, Elsevier, vol. 97(C), pages 64-77.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Heinemann, Hergen H., 1971. "Ein allgemeines Dekompositionsverfahren fuer lineare Optimierungsprobleme [A General Decomposition Algorithm for Linear Optimization Problems]," MPRA Paper 28842, University Library of Munich, Germany.
- Lee, Jisun & Joung, Seulgi & Lee, Kyungsik, 2022. "A fully polynomial time approximation scheme for the probability maximizing shortest path problem," European Journal of Operational Research, Elsevier, vol. 300(1), pages 35-45.
- Harry M. Markowitz, 2004.
"Trains of Thought,"
Chapters, in: Michael Szenberg & Lall Ramrattan (ed.), Reflections of Eminent Economists, chapter 17,
Edward Elgar Publishing.
- Harry M. Markowitz, 1993. "Trains of Thought," The American Economist, Sage Publications, vol. 37(1), pages 3-9, March.
- Defeng Liu & Andrea Lodi & Mathieu Tanneau, 2021. "Learning chordal extensions," Journal of Global Optimization, Springer, vol. 81(1), pages 3-22, September.
- Gass, Saul I., 1997. "The Washington operations research connection: the rest of the story," Socio-Economic Planning Sciences, Elsevier, vol. 31(4), pages 245-255, December.
- Huang, He & Gao, Song, 2012. "Optimal paths in dynamic networks with dependent random link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 579-598.
- Keeping, B.R. & Pantelides, C.C., 1998. "A distributed memory parallel algorithm for the efficient computation of sensitivities of differential-algebraic systems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 44(6), pages 545-558.
- Linzhong Liu & Haibo Mu & Juhua Yang, 2017. "Toward algorithms for multi-modal shortest path problem and their extension in urban transit network," Journal of Intelligent Manufacturing, Springer, vol. 28(3), pages 767-781, March.
- Luigi Di Puglia Pugliese & Francesca Guerriero, 2016. "On the shortest path problem with negative cost cycles," Computational Optimization and Applications, Springer, vol. 63(2), pages 559-583, March.
- Richard W. Cottle, 2005. "George B. Dantzig: Operations Research Icon," Operations Research, INFORMS, vol. 53(6), pages 892-898, December.
- Donald Goldfarb & Zhiying Jin, 1999. "An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem," Operations Research, INFORMS, vol. 47(3), pages 445-448, June.
- Zionts, Stanley, 1962. "Methods for Selection of an Optimum Route," Transportation Research Forum Conference Archive 316265, Transportation Research Forum.
- Hughes, Michael S. & Lunday, Brian J. & Weir, Jeffrey D. & Hopkinson, Kenneth M., 2021. "The multiple shortest path problem with path deconfliction," European Journal of Operational Research, Elsevier, vol. 292(3), pages 818-829.
- Tadao Takaoka, 2013. "A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected time," Journal of Combinatorial Optimization, Springer, vol. 25(2), pages 326-337, February.
- Milan Dražić & Rade Lazović & Vera Kovačević-Vujčić, 2015. "Sparsity preserving preconditioners for linear systems in interior-point methods," Computational Optimization and Applications, Springer, vol. 61(3), pages 557-570, July.
- Wang, Li & Yang, Lixing & Gao, Ziyou, 2016. "The constrained shortest path problem with stochastic correlated link travel times," European Journal of Operational Research, Elsevier, vol. 255(1), pages 43-57.
- Tobias Achterberg & Robert E. Bixby & Zonghao Gu & Edward Rothberg & Dieter Weninger, 2020. "Presolve Reductions in Mixed Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 473-506, April.
- Konstantinos Paparrizos & Nikolaos Samaras & Angelo Sifaleras, 2015. "Exterior point simplex-type algorithms for linear and network optimization problems," Annals of Operations Research, Springer, vol. 229(1), pages 607-633, June.
- Su, Jason G. & Winters, Meghan & Nunes, Melissa & Brauer, Michael, 2010. "Designing a route planner to facilitate and promote cycling in Metro Vancouver, Canada," Transportation Research Part A: Policy and Practice, Elsevier, vol. 44(7), pages 495-505, August.
- Chung-Han Hsieh, 2022. "On Solving Robust Log-Optimal Portfolio: A Supporting Hyperplane Approximation Approach," Papers 2202.03858, arXiv.org.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:39:y:2005:i:4:p:465-476. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.