| Article ID: | iaor19921948 |
| Country: | Netherlands |
| Volume: | 10 |
| Issue: | 9 |
| Start Page Number: | 497 |
| End Page Number: | 500 |
| Publication Date: | Dec 1991 |
| Journal: | Operations Research Letters |
| Authors: | Christof Thomas, Jnger Michael, Reinelt Gerhard |
| Keywords: | combinatorial analysis |
The authors present three previously unknown classes of facets for the symmetric traveling salesman polytope STSP(8) on 8 nodes which they found using a computer code. These new inequalities now allow for the complete linear description of STSP(8).