scientific article; zbMATH DE number 16722

MaRDI QIDQ3973408zbMATH OpenFDO

Authors Denis Naddef

Publication date 26 June 1992

zbMATH Keywords

handlescomb inequalitiessubtour elimination inequalitiessymmetric traveling salesman polytopeclique-tree inequalitiesteeth

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Integer programming (90C10) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• The Binested Inequalities for the Symmetric Traveling Salesman Polytope
• The Symmetric Traveling Salesman Polytope Revisited
• The Crown Inequalities for the Symmetric Traveling Salesman Polytope
• The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
• Ladders for Travelling Salesmen

Cited in

(3)

• The Symmetric Traveling Salesman Polytope Revisited
• The Binested Inequalities for the Symmetric Traveling Salesman Polytope
• The general routing polyhedron: A unifying framework

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3973408)