✦ LIBER ✦

The symmetric travelling salesman problem I. New fast lower bounds for the problem of optimal 2-matching

✍ Scribed by S. I. Sergeev

Book ID: 110153015
Publisher: SP MAIK Nauka/Interperiodica
Year: 2009
Tongue: English
Weight: 171 KB
Volume: 70
Category: Article
ISSN: 0005-1179
DOI: 10.1134/s0005117909110149

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The symmetric travelling salesman proble

The symmetric travelling salesman problem II. New low bounds

✍ S. I. Sergeev 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 262 KB

Lower bounds for the symmetric travellin

Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations

✍ T.H.C. Smith; T.W.S. Meyer; G.L. Thompson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 556 KB

A comparison of lower bounds for the sym

A comparison of lower bounds for the symmetric circulant traveling salesman problem

✍ Etienne de Klerk; Cristian Dobre 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Optimal toll design: a lower bound frame

Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem

✍ Toriello, Alejandro 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 269 KB

A new class of cutting planes for the sy

A new class of cutting planes for the symmetric travelling salesman problem

✍ Bernhard Fleischmann 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 826 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.