Counter-Example to Diaby’s et al. Linear Programming Solution to the Traveling Salesman Problem
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2025-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/cplx/3672180 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850072941855768576 |
|---|---|
| author | Radosław Hofman |
| author_facet | Radosław Hofman |
| author_sort | Radosław Hofman |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-1ce6a6f4891a40679f05677805742eef |
| institution | DOAJ |
| issn | 1099-0526 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-1ce6a6f4891a40679f05677805742eef2025-08-20T02:46:59ZengWileyComplexity1099-05262025-01-01202510.1155/cplx/3672180Counter-Example to Diaby’s et al. Linear Programming Solution to the Traveling Salesman ProblemRadosław Hofman0Independent ResearcherThe 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.http://dx.doi.org/10.1155/cplx/3672180 |
| spellingShingle | Radosław Hofman Counter-Example to Diaby’s et al. Linear Programming Solution to the Traveling Salesman Problem Complexity |
| title | Counter-Example to Diaby’s et al. Linear Programming Solution to the Traveling Salesman Problem |
| title_full | Counter-Example to Diaby’s et al. Linear Programming Solution to the Traveling Salesman Problem |
| title_fullStr | Counter-Example to Diaby’s et al. Linear Programming Solution to the Traveling Salesman Problem |
| title_full_unstemmed | Counter-Example to Diaby’s et al. Linear Programming Solution to the Traveling Salesman Problem |
| title_short | Counter-Example to Diaby’s et al. Linear Programming Solution to the Traveling Salesman Problem |
| title_sort | counter example to diaby s et al linear programming solution to the traveling salesman problem |
| url | http://dx.doi.org/10.1155/cplx/3672180 |
| work_keys_str_mv | AT radosławhofman counterexampletodiabysetallinearprogrammingsolutiontothetravelingsalesmanproblem |