Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations

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

[2]  A. Volgenant,et al.  Nonoptimal Edges for the Symmetric Traveling Salesman Problem , 1984, Oper. Res..

[3]  R. Jonker,et al.  The symmetric traveling salesman problem and edge exchanges in minimal 1-trees , 1983 .

[4]  Egon Balas,et al.  A restricted Lagrangean approach to the traveling salesman problem , 1981, Math. Program..

[5]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

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

[7]  T. H. C. Smith,et al.  A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp's 1-Tree Relaxation , 1977 .

[8]  G. Thompson,et al.  A Comparison of Two Different Lagrangean Relaxations of the Traveling Salesman Problem. , 1975 .

[9]  Gerald L. Thompson,et al.  An operator theory of parametric programming for the generalized transportation problem: II Rim, cost and bound operators† , 1975 .

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

[11]  Mandell Bellmore,et al.  Pathology of Traveling-Salesman Subtour-Elimination Algorithms , 1971, Oper. Res..

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

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