Time-Dependent, Label-Constrained Shortest Path Problems with Applications
Author
Abstract
Suggested Citation
DOI: 10.1287/trsc.37.3.278.16042
Download full text from publisher
References listed on IDEAS
- F. Glover & D. Klingman & N. Phillips, 1985. "A New Polynomially Bounded Shortest Path Algorithm," Operations Research, INFORMS, vol. 33(1), pages 65-73, February.
- Stuart E. Dreyfus, 1969. "An Appraisal of Some Shortest-Path Algorithms," Operations Research, INFORMS, vol. 17(3), pages 395-412, June.
- Fred Glover & Darwin D. Klingman & Nancy V. Phillips & Robert F. Schneider, 1985. "New Polynomial Shortest Path Algorithms and Their Computational Attributes," Management Science, INFORMS, vol. 31(9), pages 1106-1128, September.
- Refael Hassin, 1992. "Approximation Schemes for the Restricted Shortest Path Problem," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 36-42, February.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Qian Ye & Hyun Kim, 2019. "Partial Node Failure in Shortest Path Network Problems," Sustainability, MDPI, vol. 11(22), pages 1-21, November.
- Yannick Kergosien & Antoine Giret & Emmanuel Néron & Gaël Sauvanet, 2022. "An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 76-92, January.
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.- Li, Jianping & Ge, Yu & He, Shuai & Lichen, Junran, 2014. "Approximation algorithms for constructing some required structures in digraphs," European Journal of Operational Research, Elsevier, vol. 232(2), pages 307-314.
- Shisheng Li & T.C.E. Cheng & C.T. Ng & Jinjiang Yuan, 2017. "Two‐agent scheduling on a single sequential and compatible batching machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(8), pages 628-641, December.
- Gerald G. Brown & W. Matthew Carlyle, 2020. "Solving the Nearly Symmetric All-Pairs Shortest-Path Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 279-288, April.
- Michael Zabarankin & Stan Uryasev & Robert Murphey, 2006. "Aircraft routing under the risk of detection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(8), pages 728-747, December.
- Rolando Quintero & Esteban Mendiola & Giovanni Guzmán & Miguel Torres-Ruiz & Carlos Guzmán Sánchez-Mejorada, 2023. "Algorithm for the Accelerated Calculation of Conceptual Distances in Large Knowledge Graphs," Mathematics, MDPI, vol. 11(23), pages 1-30, November.
- Pijls, Wim & Post, Henk, 2009. "A new bidirectional search algorithm with shortened postprocessing," European Journal of Operational Research, Elsevier, vol. 198(2), pages 363-369, October.
- Li Guan & Jianping Li & Weidong Li & Junran Lichen, 2019. "Improved approximation algorithms for the combination problem of parallel machine scheduling and path," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 689-697, October.
- Steven K. Peterson & Richard L. Church, 2008. "A Framework for Modeling Rail Transport Vulnerability," Growth and Change, Wiley Blackwell, vol. 39(4), pages 617-641, December.
- Yang, Jinling & Chen, Zhiwei & Criado, Regino & Zhang, Shenggui, 2024. "A mathematical framework for shortest path length computation in multi-layer networks with inter-edge weighting and dynamic inter-edge weighting: The case of the Beijing bus network, China," Chaos, Solitons & Fractals, Elsevier, vol. 182(C).
- Delafield, Gemma & Smith, Greg S. & Day, Brett & Holland, Robert A. & Donnison, Caspar & Hastings, Astley & Taylor, Gail & Owen, Nathan & Lovett, Andrew, 2024. "Spatial context matters: Assessing how future renewable energy pathways will impact nature and society," Renewable Energy, Elsevier, vol. 220(C).
- Dimitri P. Bertsekas, 2019. "Robust shortest path planning and semicontractive dynamic programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(1), pages 15-37, February.
- Esaignani Selvarajah & Rui Zhang, 2014. "Supply chain scheduling to minimize holding costs with outsourcing," Annals of Operations Research, Springer, vol. 217(1), pages 479-490, June.
- Randeep Bhatia & Sudipto Guha & Samir Khuller & Yoram J. Sussmann, 1998. "Facility Location with Dynamic Distance Functions," Journal of Combinatorial Optimization, Springer, vol. 2(3), pages 199-217, September.
- Yueyue Fan & Yu Nie, 2006. "Optimal Routing for Maximizing the Travel Time Reliability," Networks and Spatial Economics, Springer, vol. 6(3), pages 333-344, September.
- Briskorn, Dirk & Choi, Byung-Cheon & Lee, Kangbok & Leung, Joseph & Pinedo, Michael, 2010. "Complexity of single machine scheduling subject to nonnegative inventory constraints," European Journal of Operational Research, Elsevier, vol. 207(2), pages 605-619, December.
- M. Reza Khani & Mohammad R. Salavatipour, 2016. "Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k , 2 ) -subgraph," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 669-685, February.
- Geng, Zhichao & Yuan, Jinjiang, 2023. "Single-machine scheduling of multiple projects with controllable processing times," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1074-1090.
- Bo Chen & Xiaotie Deng & Wenan Zang, 2004. "On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 85-95, March.
- Salim, V., 1997. "A comparison of shortest path algorithms in urban traffic assignment," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 43(3), pages 545-551.
- Elise D. Miller-Hooks & Hani S. Mahmassani, 2000. "Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks," Transportation Science, INFORMS, vol. 34(2), pages 198-215, May.
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:37:y:2003:i:3:p:278-293. 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.