IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v102y1997i1p157-175.html
   My bibliography  Save this article

Estimating the Held-Karp lower bound for the geometric TSP

Author

Listed:
  • Valenzuela, Christine L.
  • Jones, Antonia J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Valenzuela, Christine L. & Jones, Antonia J., 1997. "Estimating the Held-Karp lower bound for the geometric TSP," European Journal of Operational Research, Elsevier, vol. 102(1), pages 157-175, October.
    • Handle: RePEc:eee:ejores:v:102:y:1997:i:1:p:157-175
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(96)00214-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Volgenant, Ton & Jonker, Roy, 1982. "A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation," European Journal of Operational Research, Elsevier, vol. 9(1), pages 83-89, January.
    2. Michael Held & Richard M. Karp, 1970. "The Traveling-Salesman Problem and Minimum Spanning Trees," Operations Research, INFORMS, vol. 18(6), pages 1138-1162, December.
    3. Michel X. Goemans & Dimitris J. Bertsimas, 1991. "Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 72-89, February.
    4. WOLSEY, Laurence A., 1980. "Heuristic analysis, linear programming and branch and bound," LIDAM Reprints CORE 407, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Peter Reiter & Walter Gutjahr, 2012. "Exact hybrid algorithms for solving a bi-objective vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(1), pages 19-43, March.
    2. Roberto Aringhieri & Sara Bigharaz & Davide Duma & Alberto Guastalla, 2022. "Fairness in ambulance routing for post disaster management," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(1), pages 189-211, March.

    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.
    1. Peter Reiter & Walter Gutjahr, 2012. "Exact hybrid algorithms for solving a bi-objective vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(1), pages 19-43, March.
    2. Zamani, Reza & Lau, Sim Kim, 2010. "Embedding learning capability in Lagrangean relaxation: An application to the travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 201(1), pages 82-88, February.
    3. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    4. Öztürkoğlu, Ömer & Hoser, Deniz, 2019. "A discrete cross aisle design model for order-picking warehouses," European Journal of Operational Research, Elsevier, vol. 275(2), pages 411-430.
    5. 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.
    6. Sivakumar, Rathinam & Sengupta, Raja, 2007. "5/3-Approximation Algorithm for a Multiple Depot, Terminal Hamiltonian Path Problem," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt3dw086dn, Institute of Transportation Studies, UC Berkeley.
    7. Rathinam, Sivakumar & Sengupta, Raja, 2007. "3/2-Approximation Algorithm for a Generalized, Multiple Depot, Hamiltonina Path Problem," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt06p2815q, Institute of Transportation Studies, UC Berkeley.
    8. Moses Charikar & Michel X. Goemans & Howard Karloff, 2006. "On the Integrality Ratio for the Asymmetric Traveling Salesman Problem," Mathematics of Operations Research, INFORMS, vol. 31(2), pages 245-252, May.
    9. Gábor Braun & Samuel Fiorini & Sebastian Pokutta & David Steurer, 2015. "Approximation Limits of Linear Programs (Beyond Hierarchies)," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 756-772, March.
    10. de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2007. "On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)," Discussion Paper 2007-101, Tilburg University, Center for Economic Research.
    11. Lorena, Luiz Antonio N. & Goncalves Narciso, Marcelo, 2002. "Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems," European Journal of Operational Research, Elsevier, vol. 138(3), pages 473-483, May.
    12. de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2008. "On Semidefinite Programming Relaxations of the Traveling Salesman Problem (revision of DP 2007-101)," Discussion Paper 2008-96, Tilburg University, Center for Economic Research.
    13. Helsgaun, Keld, 2000. "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, Elsevier, vol. 126(1), pages 106-130, October.
    14. Ibrahim Muter & Tevfik Aytekin, 2017. "Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 405-421, August.
    15. Rostami, Borzou & Malucelli, Federico & Belotti, Pietro & Gualandi, Stefano, 2016. "Lower bounding procedure for the asymmetric quadratic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 584-592.
    16. Deeparnab Chakrabarty & Chaitanya Swamy, 2016. "Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 865-883, August.
    17. Tang, Lixin & Liu, Jiyin & Rong, Aiying & Yang, Zihou, 2000. "A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex," European Journal of Operational Research, Elsevier, vol. 124(2), pages 267-282, July.
    18. 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.
    19. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
    20. Santosh Kumar & Elias Munapo & ‘Maseka Lesaoana & Philimon Nyamugure, 2018. "A minimum spanning tree based heuristic for the travelling salesman tour," OPSEARCH, Springer;Operational Research Society of India, vol. 55(1), pages 150-164, March.

    More about this item

    Statistics

    Access and download statistics

    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:102:y:1997:i:1:p:157-175. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.