Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies

This paper shows that facet-inducing inequalities can be incorporated into graphical-construct-based Lagrangian relaxation methodologies by including them as dualized constraints. It develops an algorithm that successively identifies additional facet-inducing inequalities and incorporates them into the Lagrangian function. Computational experience shows that the algorithm can resolve duality gaps using relatively few facet-inducing inequalities.

[1]  J. P. Secrétan,et al.  Der Saccus endolymphaticus bei Entzündungsprozessen , 1944 .

[2]  Martin Grötschel,et al.  On the symmetric travelling salesman problem: Solution of a 120-city problem , 1980 .

[3]  M. R. Rao,et al.  Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[4]  Selmer M. Johnson,et al.  On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem , 1959 .

[5]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[6]  G. L. Thompson,et al.  A Heuristic Approach to Solving Travelling Salesman Problems , 1964 .

[7]  Agha Iqbal Ali,et al.  Graphical-structure-based models for routing problems , 1988 .

[8]  Bezalel Gavish,et al.  An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems , 1986, Oper. Res..

[9]  Bernhard Fleischmann,et al.  A new class of cutting planes for the symmetric travelling salesman problem , 1988, Math. Program..

[10]  Kavindra Malik,et al.  A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem , 1990 .

[11]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[12]  M. Padberg,et al.  Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .

[13]  Sylvia C. Boyd,et al.  Optimizing over the subtour polytope of the travelling salesman problem , 1990, Math. Program..

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

[15]  Manfred W. Padberg,et al.  On the symmetric travelling salesman problem: A computational study , 1980 .

[16]  H. Crowder,et al.  Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

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

[18]  Jakob Krarup,et al.  Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem , 1974, Math. Program..

[19]  Agha Iqbal Ali,et al.  The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm , 1986, Discret. Appl. Math..

[20]  Martin Grötschel,et al.  On the symmetric travelling salesman problem I: Inequalities , 1979, Math. Program..

[21]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[22]  Giovanni Rinaldi,et al.  The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities , 1991, Math. Program..