Online routing and searching on graphs with blocked edges
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-022-00876-9
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Yinfeng Xu & Maolin Hu & Bing Su & Binhai Zhu & Zhijun Zhu, 2009. "The canadian traveller problem and its competitive analysis," Journal of Combinatorial Optimization, Springer, vol. 18(2), pages 195-205, August.
- Patrick Jaillet & Michael R. Wagner, 2006. "Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios," Transportation Science, INFORMS, vol. 40(2), pages 200-210, May.
- Henan Liu & Huili Zhang & Yi Xu, 2021. "The m-Steiner Traveling Salesman Problem with online edge blockages," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 844-860, May.
- Huili Zhang & Yinfeng Xu, 2018. "Online covering salesman problem," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 941-954, April.
- Zhang, Huili & Tong, Weitian & Xu, Yinfeng & Lin, Guohui, 2015. "The Steiner Traveling Salesman Problem with online edge blockages," European Journal of Operational Research, Elsevier, vol. 243(1), pages 30-40.
- Patrick Jaillet & Michael R. Wagner, 2008. "Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses," Operations Research, INFORMS, vol. 56(3), pages 745-757, June.
- Akbari, Vahid & Shiri, Davood, 2021. "Weighted online minimum latency problem with edge uncertainty," European Journal of Operational Research, Elsevier, vol. 295(1), pages 51-65.
- Marco Bender & Stephan Westphal, 2015. "An optimal randomized online algorithm for the $$k$$ k -Canadian Traveller Problem on node-disjoint paths," Journal of Combinatorial Optimization, Springer, vol. 30(1), pages 87-96, July.
- Davood Shiri & F. Sibel Salman, 2019. "Competitive analysis of randomized online strategies for the multi-agent k-Canadian Traveler Problem," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 848-865, April.
- Davood Shiri & Vahid Akbari & F. Sibel Salman, 2020. "Online routing and scheduling of search-and-rescue teams," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(3), pages 755-784, September.
- Davood Shiri & F. Sibel Salman, 2019. "On the randomized online strategies for the k-Canadian traveler problem," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 254-267, July.
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.- Akbari, Vahid & Shiri, Davood, 2021. "Weighted online minimum latency problem with edge uncertainty," European Journal of Operational Research, Elsevier, vol. 295(1), pages 51-65.
- Akbari, Vahid & Shiri, Davood & Sibel Salman, F., 2021. "An online optimization approach to post-disaster road restoration," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 1-25.
- Davood Shiri & Vahid Akbari, 2021. "Online Failure Diagnosis in Interdependent Networks," SN Operations Research Forum, Springer, vol. 2(1), pages 1-14, March.
- Shiri, Davood & Akbari, Vahid & Hassanzadeh, Ali, 2024. "The Capacitated Team Orienteering Problem: An online optimization framework with predictions of unknown accuracy," Transportation Research Part B: Methodological, Elsevier, vol. 185(C).
- Zhang, Huili & Tong, Weitian & Xu, Yinfeng & Lin, Guohui, 2015. "The Steiner Traveling Salesman Problem with online edge blockages," European Journal of Operational Research, Elsevier, vol. 243(1), pages 30-40.
- Zhang, Huili & Tong, Weitian & Lin, Guohui & Xu, Yinfeng, 2019. "Online minimum latency problem with edge uncertainty," European Journal of Operational Research, Elsevier, vol. 273(2), pages 418-429.
- Davood Shiri & F. Sibel Salman, 2017. "On the online multi-agent O–D k-Canadian Traveler Problem," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 453-461, August.
- Davood Shiri & Vahid Akbari & F. Sibel Salman, 2024. "Online algorithms for ambulance routing in disaster response with time-varying victim conditions," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(3), pages 785-819, September.
- Tippong, Danuphon & Petrovic, Sanja & Akbari, Vahid, 2022. "A review of applications of operational research in healthcare coordination in disaster management," European Journal of Operational Research, Elsevier, vol. 301(1), pages 1-17.
- Henan Liu & Huili Zhang & Yi Xu, 2021. "The m-Steiner Traveling Salesman Problem with online edge blockages," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 844-860, May.
- Melih Çelik & Özlem Ergun & Pınar Keskinocak, 2015. "The Post-Disaster Debris Clearance Problem Under Incomplete Information," Operations Research, INFORMS, vol. 63(1), pages 65-85, February.
- Xingang Wen & Yinfeng Xu & Huili Zhang, 2015. "Online traveling salesman problem with deadlines and service flexibility," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 545-562, October.
- Davood Shiri & F. Sibel Salman, 2019. "On the randomized online strategies for the k-Canadian traveler problem," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 254-267, July.
- Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
- Cong Chen & Huili Zhang & Yinfeng Xu, 2022. "Online machine minimization with lookahead," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1149-1172, July.
- Wadi Khalid Anuar & Lai Soon Lee & Hsin-Vonn Seow & Stefan Pickl, 2021. "A Multi-Depot Vehicle Routing Problem with Stochastic Road Capacity and Reduced Two-Stage Stochastic Integer Linear Programming Models for Rollout Algorithm," Mathematics, MDPI, vol. 9(13), pages 1-44, July.
- Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
- Dimitris Bertsimas & Patrick Jaillet, & Sébastien Martin, 2019. "Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications," Operations Research, INFORMS, vol. 67(1), pages 143-162, January.
- Patrick Jaillet & Michael R. Wagner, 2008. "Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses," Operations Research, INFORMS, vol. 56(3), pages 745-757, June.
- Ananya Christman & William Forcier & Aayam Poudel, 2018. "From theory to practice: maximizing revenues for on-line dial-a-ride," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 512-529, February.
More about this item
Keywords
Competitive analysis; Online blocked edges; Routing; Searching;All these keywords.
Statistics
Access and download statisticsCorrections
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:spr:jcomop:v:44:y:2022:i:2:d:10.1007_s10878-022-00876-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.