IDEAS home Printed from https://ideas.repec.org/a/wly/complx/v2025y2025i1n3672180.html

Counter‐Example to Diaby’s et al. Linear Programming Solution to the Traveling Salesman Problem

Author

Listed:
  • Radosław Hofman

Abstract

This article presents a method of constructing counter‐examples and a complete counter‐example to the linear programming model alleged to be the solution to the traveling salesman problem. The counter‐example is checked against the model proposed by Diaby et al. However, it applies to all similar formulations of the TSP problem. Although the model in question was published in 2006, and there were several discussions regarding its correctness, the counter‐example was never presented. The presented counter‐example is a regular graph, and the aim was not to have an example with the least possible size; therefore, the focus was on clarity. The counter‐example has, therefore, 366 nodes in two main clusters, each node (in the main part) having exactly four connections to other nodes in the cluster.

Suggested Citation

  • Radosław Hofman, 2025. "Counter‐Example to Diaby’s et al. Linear Programming Solution to the Traveling Salesman Problem," Complexity, John Wiley & Sons, vol. 2025(1).
    • Handle: RePEc:wly:complx:v:2025:y:2025:i:1:n:3672180
    DOI: 10.1155/cplx/3672180
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/cplx/3672180
    Download Restriction: no
    File URL: https://libkey.io/10.1155/cplx/3672180?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. Moustapha Diaby & Mark H. Karwan, 2017. "Limits to the scope of applicability of extended formulations theory for LP models of combinatorial optimisation problems," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 10(1), pages 18-33.
    Full references (including those not matched with items on IDEAS)

    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.

      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:wly:complx:v:2025:y:2025:i:1:n:3672180. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/8503 .

      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.