A Complete and irredundant linear description of the asymmetric traveling salesman polytope on 6 nodes

Reinhardt Euler (1) , Hervé Le Verge (2)

1 Lab-STICC_UBO_CACS_MOCS
2 API - Parallel VLSI Architectures

Using a refined version of Chernikova's algorithm we determined a complete and irredundant description of the asymmetric traveling salesman polytope on 6 nodes. Besides the 11 equations describing the affine hull of this polytope our description consists of 319.015 facet-defining inequalities.

Domaines: Autre [cs.OH]

Reinhardt Euler, Hervé Le Verge. A Complete and irredundant linear description of the asymmetric traveling salesman polytope on 6 nodes. [Research Report] RR-1791, INRIA. 1992. ⟨inria-00077031⟩