IDEAS home Printed from https://ideas.repec.org/p/tiu/tiucen/ea23cd70-a3b1-401a-aa3f-045344716153.html
   My bibliography  Save this paper

On Semidefinite Programming Relaxations of the Traveling Salesman Problem (revision of DP 2007-101)

Author

Listed:
  • de Klerk, E.

    (Tilburg University, Center For Economic Research)

  • Pasechnik, D.V.

    (Tilburg University, Center For Economic Research)

  • Sotirov, R.

    (Tilburg University, Center For Economic Research)

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:tiu:tiucen:ea23cd70-a3b1-401a-aa3f-045344716153
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/1046696/2008-96.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Michael Held & Richard M. Karp, 1970. "The Traveling-Salesman Problem and Minimum Spanning Trees," Operations Research, INFORMS, vol. 18(6), pages 1138-1162, December.
    2. G. Dantzig & R. Fulkerson & S. Johnson, 1954. "Solution of a Large-Scale Traveling-Salesman Problem," Operations Research, INFORMS, vol. 2(4), pages 393-410, November.
    3. de Klerk, E. & Sotirov, R., 2007. "Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem," Discussion Paper 2007-44, Tilburg University, Center for Economic Research.
    4. Qing Zhao & Stefan E. Karisch & Franz Rendl & Henry Wolkowicz, 1998. "Semidefinite Programming Relaxations for the Quadratic Assignment Problem," Journal of Combinatorial Optimization, Springer, vol. 2(1), pages 71-109, March.
    5. GOEMANS, Michel & RENDL, Franz, 1999. "Semidefinite programs and association schemes," LIDAM Discussion Papers CORE 1999062, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. T. Christof & G. Reinelt, 1996. "Combinatorial optimization and small polytopes," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 4(1), pages 1-53, June.
    7. 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. Sungwoo Park & Dianne P. O’Leary, 2015. "A Polynomial Time Constraint-Reduced Algorithm for Semidefinite Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 558-571, August.
    2. E. de Klerk & R. Sotirov & U. Truetsch, 2015. "A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 378-391, May.
    3. de Klerk, E. & Pasechnik, D.V., 2009. "On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems," Discussion Paper 2009-54, Tilburg University, Center for Economic Research.
    4. Michael Orlitzky, 2021. "Gaddum’s test for symmetric cones," Journal of Global Optimization, Springer, vol. 79(4), pages 927-940, April.
    5. Klerk, Etienne de, 2010. "Exploiting special structure in semidefinite programming: A survey of theory and applications," European Journal of Operational Research, Elsevier, vol. 201(1), pages 1-10, February.
    6. Vivek Bagaria & Jian Ding & David Tse & Yihong Wu & Jiaming Xu, 2020. "Hidden Hamiltonian Cycle Recovery via Linear Programming," Operations Research, INFORMS, vol. 68(1), pages 53-70, January.
    7. de Klerk, E. & Pasechnik, D.V., 2009. "On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems," Other publications TiSEM 3b5033a4-98bc-4969-aa57-d, Tilburg University, School of Economics and Management.

    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. 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.
    2. E. de Klerk & R. Sotirov & U. Truetsch, 2015. "A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 378-391, May.
    3. Vivek Bagaria & Jian Ding & David Tse & Yihong Wu & Jiaming Xu, 2020. "Hidden Hamiltonian Cycle Recovery via Linear Programming," Operations Research, INFORMS, vol. 68(1), pages 53-70, January.
    4. 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.
    5. 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.
    6. Ghosh, Diptesh & Sumanta Basu, 2011. "Diversified Local Search for the Traveling Salesman Problem," IIMA Working Papers WP2011-01-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
    7. Jiming Peng & Tao Zhu & Hezhi Luo & Kim-Chuan Toh, 2015. "Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting," Computational Optimization and Applications, Springer, vol. 60(1), pages 171-198, January.
    8. Yichuan Ding & Dongdong Ge & Henry Wolkowicz, 2011. "On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming," Mathematics of Operations Research, INFORMS, vol. 36(1), pages 88-104, February.
    9. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    10. Elena Nechita & Gloria Cerasela Crişan & Laszlo Barna Iantovics & Yitong Huang, 2020. "On the Resilience of Ant Algorithms. Experiment with Adapted MMAS on TSP," Mathematics, MDPI, vol. 8(5), pages 1-20, May.
    11. 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.
    12. Klerk, Etienne de, 2010. "Exploiting special structure in semidefinite programming: A survey of theory and applications," European Journal of Operational Research, Elsevier, vol. 201(1), pages 1-10, February.
    13. 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.
    14. Rathinam, Sivakumar & Sengupta, Raja, 2007. "3/2-Approximation Algorithm for a Generalized, Multiple Depot, Hamiltonian Path Problem," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt06p2815q, Institute of Transportation Studies, UC Berkeley.
    15. 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.
    16. 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.
    17. Schuijbroek, J. & Hampshire, R.C. & van Hoeve, W.-J., 2017. "Inventory rebalancing and vehicle routing in bike sharing systems," European Journal of Operational Research, Elsevier, vol. 257(3), pages 992-1004.
    18. E. R. van Dam & R. Sotirov, 2015. "On Bounding the Bandwidth of Graphs with Symmetry," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 75-88, February.
    19. de Klerk, Etienne & -Nagy, Marianna E. & Sotirov, Renata & Truetsch, Uwe, 2014. "Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 488-499.
    20. 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.

    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:tiu:tiucen:ea23cd70-a3b1-401a-aa3f-045344716153. 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: Richard Broekman (email available below). General contact details of provider: http://center.uvt.nl .

    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.