The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities

@article{Naddef1991TheST,
title={The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities},
author={Denis Naddef and Giovanni Rinaldi},
journal={Math. Program.},
year={1991},
volume={51},
pages={359-400}
}

The graphical relaxation of the Traveling Salesman Problem is the relaxation obtained by requiring that the salesman visit each city at least once instead of exactly once. This relaxation has already led to a better understanding of the Traveling Salesman polytope in Cornu6jols, Fonlupt and Naddef (1985). We show here how one can compose facet-inducing inequalities for the graphical traveling salesman polyhedron, and obtain other facet-inducing inequalities. This leads to new valid inequalitiesâ€¦Â CONTINUE READING