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!
|