Complete linear descriptions of small asymmetric traveling salesman polytopes Original Research Article

Using a refined version of Chernikovaʹs algorithm we determined a complete and irredundant linear description of small asymmetric traveling salesman polytopes. We present such a description for the monotone polytope on 5 nodes consisting of 7615 facet-defining inequalities, and we present 319015 facet-defining inequalities which, together with 11 equations, fully describe the (non-monotone) asymmetric polytope for 6 nodes.