Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
Author
Abstract
Suggested Citation
DOI: 10.1287/moor.2016.0831
Download full text from publisher
References listed on IDEAS
- Patrick Jaillet, 1988. "A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited," Operations Research, INFORMS, vol. 36(6), pages 929-936, December.
- Brian C. Dean & Michel X. Goemans & Jan Vondrák, 2008. "Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 945-964, November.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Fatemeh Navidi & Prabhanjan Kambadur & Viswanath Nagarajan, 2020. "Adaptive Submodular Ranking and Routing," Operations Research, INFORMS, vol. 68(3), pages 856-877, May.
- Bian, Zheyong & Liu, Xiang, 2019. "Mechanism design for first-mile ridesharing based on personalized requirements part II: Solution algorithm for large-scale problems," Transportation Research Part B: Methodological, Elsevier, vol. 120(C), pages 172-192.
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.- Alejandro Toriello & William B. Haskell & Michael Poremba, 2014. "A Dynamic Traveling Salesman Problem with Stochastic Arc Costs," Operations Research, INFORMS, vol. 62(5), pages 1107-1125, October.
- Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2021. "Queue-constrained packing: A vehicle ferry case study," European Journal of Operational Research, Elsevier, vol. 289(2), pages 727-741.
- Luca Quadrifoglio & Randolph W. Hall & Maged M. Dessouky, 2006. "Performance and Design of Mobility Allowance Shuttle Transit Services: Bounds on the Maximum Longitudinal Velocity," Transportation Science, INFORMS, vol. 40(3), pages 351-363, August.
- Martin Skutella & Maxim Sviridenko & Marc Uetz, 2016. "Unrelated Machine Scheduling with Stochastic Processing Times," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 851-864, August.
- Ji, Chenlu & Mandania, Rupal & Liu, Jiyin & Liret, Anne, 2022. "Scheduling on-site service deliveries to minimise the risk of missing appointment times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
- Roberto Tadei & Guido Perboli & Francesca Perfetti, 2017. "The multi-path Traveling Salesman Problem with stochastic travel costs," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 3-23, March.
- Hall, Randolph W., 1992. "Pickup and Delivery Systems For Overnight Carriers," University of California Transportation Center, Working Papers qt5j97q5xc, University of California Transportation Center.
- Edward Kim, M. & Schonfeld, Paul & Roche, Austin & Raleigh, Chelsie, 2022. "Optimal service zones and frequencies for flexible-route freight deliveries," Transportation Research Part A: Policy and Practice, Elsevier, vol. 159(C), pages 182-199.
- Albareda-Sambola, Maria & Fernandez, Elena & Laporte, Gilbert, 2007. "Heuristic and lower bound for a stochastic location-routing problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 940-955, June.
- Ann M. Campbell & Barrett W. Thomas, 2008. "Probabilistic Traveling Salesman Problem with Deadlines," Transportation Science, INFORMS, vol. 42(1), pages 1-21, February.
- Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2006. "Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 40(2), pages 211-225, May.
- Kelley, Jason & Kuby, Michael & Sierra, Rodrigo, 2013. "Transportation network optimization for the movement of indigenous goods in Amazonian Ecuador," Journal of Transport Geography, Elsevier, vol. 28(C), pages 89-100.
- Papastavrou, Jason D., 1996. "A stochastic and dynamic routing policy using branching processes with state dependent immigration," European Journal of Operational Research, Elsevier, vol. 95(1), pages 167-177, November.
- Albareda-Sambola, Maria & Fernández, Elena & Saldanha-da-Gama, Francisco, 2011. "The facility location problem with Bernoulli demands," Omega, Elsevier, vol. 39(3), pages 335-345, June.
- Ansari, Sina & Başdere, Mehmet & Li, Xiaopeng & Ouyang, Yanfeng & Smilowitz, Karen, 2018. "Advancements in continuous approximation models for logistics and transportation systems: 1996–2016," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 229-252.
- Anupam Gupta & Ravishankar Krishnaswamy & Viswanath Nagarajan & R. Ravi, 2015. "Running Errands in Time: Approximation Algorithms for Stochastic Orienteering," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 56-79, February.
- Figliozzi, Miguel Andres, 2009. "Planning approximations to the average length of vehicle routing problems with time window constraints," Transportation Research Part B: Methodological, Elsevier, vol. 43(4), pages 438-447, May.
- Peeta, Srinivas & Zhou, Chao, 2006. "Stochastic quasi-gradient algorithm for the off-line stochastic dynamic traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 40(3), pages 179-206, March.
- Bertsimas, Dimitris. & Jaillet, Patrick. & Odoni, Amedeo R., 1989. "A priori optimization," Working papers 3059-89., Massachusetts Institute of Technology (MIT), Sloan School of Management.
- Marco Silva & João Pedro Pedroso, 2022. "Deep Reinforcement Learning for Crowdshipping Last-Mile Delivery with Endogenous Uncertainty," Mathematics, MDPI, vol. 10(20), pages 1-23, October.
More about this item
Keywords
approximation algorithms; stochastic optimization; decision trees; vehicle routing;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:inm:ormoor:v:42:y:2017:i:3:p:876-896. 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.