论文信息 - Ladders for Travelling Salesmen - 字舞流文

Ladders for Travelling Salesmen

We introduce a new class of valid inequalities for the symmetric travelling salesman polytope. The family is not of the common handle-tooth variety. We show that these inequalities are all facet-inducing and have Chvatal rank 2.

Maurice Queyranne | William H. Cunningham | Yaoguang Wang | Sylvia C. Boyd

[1] Martin Grötschel,et al. Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..

[2] William R. Pulleyblank,et al. Clique Tree Inequalities and the Symmetric Travelling Salesman Problem , 1986, Math. Oper. Res..

[3] Vasek Chvátal,et al. Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[4] Denis Naddef. The Binested Inequalities for the Symmetric Traveling Salesman Polytope , 1992, Math. Oper. Res..

[5] Maurice Queyranne,et al. Hamiltonian path and symmetric travelling salesman polytopes , 1993, Math. Program..

[6] Martin Grötschel,et al. On the symmetric travelling salesman problem II: Lifting theorems and facets , 1979, Math. Program..

[7] William H. Cunningham,et al. Small Travelling Salesman Polytopes , 1991, Math. Oper. Res..

[8] Jean-Maurice Clochard,et al. Using path inequalities in a branch and cut code for the symmetric traveling salesman problem , 1993, IPCO.