Polynomial approximation algorithms with performance guarantees: An introduction-by-example
Author
Abstract
Suggested Citation
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
- CORNUEJOLS, Gérard & NEMHAUSER, George L., 1978. "Tight bounds for Christofides' traveling salesman heuristic," LIDAM Reprints CORE 327, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Christos H. Papadimitriou & Mihalis Yannakakis, 1993. "The Traveling Salesman Problem with Distances One and Two," Mathematics of Operations Research, INFORMS, vol. 18(1), pages 1-11, February.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Gais Alhadi & Imed Kacem & Pierre Laroche & Izzeldin M. Osman, 2020. "Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines," Annals of Operations Research, Springer, vol. 285(1), pages 369-395, February.
- Ausiello, G. & Paschos, V.Th., 2006. "Reductions, completeness and the hardness of approximability," European Journal of Operational Research, Elsevier, vol. 172(3), pages 719-739, August.
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.- Lenstra, J. K. & Rinnooy Kan, A. H. G., 1979. "Complexity Of Vehicle Routing And Scheduling Problems," Econometric Institute Archives 272191, Erasmus University Rotterdam.
- Federico Della Croce, 2016. "MP or not MP: that is the question," Journal of Scheduling, Springer, vol. 19(1), pages 33-42, February.
- Martijn Ee & René Sitters, 2020. "The Chinese deliveryman problem," 4OR, Springer, vol. 18(3), pages 341-356, September.
- Wenkai Dai & Yongjie Yang, 2019. "Reoptimization of minimum latency problem revisited: don’t panic when asked to revisit the route after local modifications," Journal of Combinatorial Optimization, Springer, vol. 37(2), pages 601-619, February.
- Mnich, Matthias & Mömke, Tobias, 2018. "Improved integrality gap upper bounds for traveling salesperson problems with distances one and two," European Journal of Operational Research, Elsevier, vol. 266(2), pages 436-457.
- Ceranoglu, Ahmet N. & Duman, Ekrem, 2013. "VRP12 (vehicle routing problem with distances one and two) with side constraints," International Journal of Production Economics, Elsevier, vol. 144(2), pages 461-467.
- E Duman & M H Ozcelik & A N Ceranoglu, 2005. "A TSP (1,2) application arising in cable assembly shops," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(6), pages 642-648, June.
- 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.
- Monnot, Jerome & Paschos, Vangelis Th. & Toulouse, Sophie, 2003. "Differential approximation results for the traveling salesman problem with distances 1 and 2," European Journal of Operational Research, Elsevier, vol. 145(3), pages 557-568, March.
- Shiming Li & Wei Yu & Zhaohui Liu, 2024. "Improved approximation algorithms for the k-path partition problem," Journal of Global Optimization, Springer, vol. 90(4), pages 983-1006, December.
- Bogdan Armaselu, 2023. "Approximation algorithms for some extensions of the maximum profit routing problem," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-22, January.
- Mathias Weller & Annie Chateau & Rodolphe Giroudeau & Jean-Claude König & Valentin Pollet, 2018. "On residual approximation in solution extension problems," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1195-1220, November.
- Tatarakis, A. & Minis, I., 2009. "Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns," European Journal of Operational Research, Elsevier, vol. 197(2), pages 557-571, September.
- Renzo Gómez & Yoshiko Wakabayashi, 2020. "Nontrivial path covers of graphs: existence, minimization and maximization," Journal of Combinatorial Optimization, Springer, vol. 39(2), pages 437-456, February.
- Miroslav Chlebík & Janka Chlebíková, 2022. "Weighted amplifiers and inapproximability results for Travelling Salesman problem," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1368-1390, July.
- Monnot, Jerome, 2005. "Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)," European Journal of Operational Research, Elsevier, vol. 161(3), pages 721-735, March.
- Cristina Bazgan & Arne Herzel & Stefan Ruzika & Clemens Thielen & Daniel Vanderpooten, 2022. "An approximation algorithm for a general class of parametric optimization problems," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1328-1358, July.
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:eee:ejores:v:165:y:2005:i:3:p:555-568. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.