✦ LIBER ✦

Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations

✍ Scribed by T.H.C. Smith; T.W.S. Meyer; G.L. Thompson

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 556 KB
Volume: 26
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90101-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Hybrid Genetic—GRASP Algorithm Using L

A Hybrid Genetic—GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem

✍ Yannis Marinakis; Athanasios Migdalas; Panos M. Pardalos 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 223 KB

An improved assignment lower bound for t

An improved assignment lower bound for the euclidean traveling salesman problem

✍ William R Stewart Jr. 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 353 KB

A bound for the symmetric travelling sal

A bound for the symmetric travelling salesman problem through matroid formulation

✍ Peter Cowling; Francesco Maffioli 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 657 KB

A branch and bound algorithm for the sym

A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation

✍ Ton Volgenant; Roy Jonker 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 538 KB

On the Held-Karp relaxation for the asym

On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems

✍ Robert Carr; Santosh Vempala 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 200 KB

A new lower bound for the geometric trav

A new lower bound for the geometric traveling salesman problem in terms of discrepancy

✍ Stefan Steinerberger 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 211 KB

We give a new lower bound for the shortest hamiltonian path through n points of [0, 1] d in terms of the discrepancy of these n points. This improves an earlier result by Steele.