✦ LIBER ✦

Minimax 2-connected subgraphs and the bottleneck traveling salesman problem

✍ Scribed by E. A. Timofeev

Publisher: Springer US
Year: 1980
Tongue: English
Weight: 580 KB
Volume: 15
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01068903

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Triangle inequality and symmetry in conn

Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem

✍ Bernd Jeromin; Frank Körner 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 328 KB

A diagonal completion and 2-optimal proc

A diagonal completion and 2-optimal procedure for the travelling salesman problem

✍ J.R. King; X.Y. Zhang; G.H. Jin 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 934 KB

A fast diagonal completion algorithm is developed for constructing a good initial feasible solution for travelling salesman problems. The algorithm can be combined with any tour improvement approach but is specifically considered here in conjunction with the 2-optimal method which is shown to give g