On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets

DOI10.1007/BFb0120923zbMath0467.90046OpenAlexW205047139MaRDI QIDQ3920990

Martin Grötschel, Yoshiko Wakabayashi

Publication date: 1981

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0120923

zbMATH Keywords

cutting planesfacetscomplete digraphhamiltonian circuitshypohamiltonian digraphshypotraceable digraphshypotraceable facetsmonotone asymmetric travelling salesman polytope

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Polytopes and polyhedra (52Bxx)

Related Items (5)

On cutting-plane proofs in combinatorial optimization ⋮ Computational results on the traceability of oriented graphs of small order ⋮ On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets ⋮ The order of hypotraceable oriented graphs ⋮ Hypotraceable digraphs

This page was built for publication: On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets