IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v61y2013i6p1429-1434.html
   My bibliography  Save this article

Technical Note---On Traveling Salesman Games with Asymmetric Costs

Author

Listed:
  • Alejandro Toriello

    (H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332)

  • Nelson A. Uhan

    (Mathematics Department, United States Naval Academy, Annapolis, Maryland 21402)

Abstract

We consider cooperative traveling salesman games with nonnegative asymmetric costs satisfying the triangle inequality. We construct a stable cost allocation with budget balance guarantee equal to the Held-Karp integrality gap for the asymmetric traveling salesman problem, using the parsimonious property and a previously unknown connection to linear production games. We also show that our techniques extend to larger classes of network design games. We then provide a simple example showing that our cost allocation does not necessarily achieve the best possible budget balance guarantee, even among cost allocations stable for the game defined by the Held-Karp relaxation, and discuss its implications on future work on traveling salesman games.

Suggested Citation

  • Alejandro Toriello & Nelson A. Uhan, 2013. "Technical Note---On Traveling Salesman Games with Asymmetric Costs," Operations Research, INFORMS, vol. 61(6), pages 1429-1434, December.
    • Handle: RePEc:inm:oropre:v:61:y:2013:i:6:p:1429-1434
    DOI: 10.1287/opre.2013.1225
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2013.1225
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2013.1225?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. 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. Mateusz Zając, 2022. "The Analysis of Selected Factors Improving the Cargo Susceptibility to Modal Shift," Energies, MDPI, vol. 15(23), pages 1-16, November.
    2. Guajardo, Mario & Rönnqvist, Mikael & Flisberg, Patrik & Frisk, Mikael, 2018. "Collaborative transportation with overlapping coalitions," European Journal of Operational Research, Elsevier, vol. 271(1), pages 238-249.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Frans Schalekamp & David P. Williamson & Anke van Zuylen, 2014. "2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 403-417, May.
    6. 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.
    7. Geneviève Benoit & Sylvia Boyd, 2008. "Finding the Exact Integrality Gap for Small Traveling Salesman Problems," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 921-931, November.
    8. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    9. Arnaud Fréville & SaÏd Hanafi, 2005. "The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects," Annals of Operations Research, Springer, vol. 139(1), pages 195-227, October.
    10. 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.
    11. 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.
    12. Zachary Friggstad & Anupam Gupta & Mohit Singh, 2016. "An Improved Integrality Gap for Asymmetric TSP Paths," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 745-757, August.
    13. 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.
    14. Arash Asadpour & Michel X. Goemans & Aleksander Mądry & Shayan Oveis Gharan & Amin Saberi, 2017. "An O (log n /log log n )-Approximation Algorithm for the Asymmetric Traveling Salesman Problem," Operations Research, INFORMS, vol. 65(4), pages 1043-1061, August.
    15. Huili Zhang & Yinfeng Xu, 2018. "Online covering salesman problem," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 941-954, April.
    16. 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.
    17. 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.

    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:oropre:v:61:y:2013:i:6:p:1429-1434. 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.

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