✦ LIBER ✦

Complexity of the traveling-salesman problem in the class of monotonic improvement algorithms

✍ Scribed by V. G. Vizing

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the stochastic complexity of the asym

✍ Hans-Ulrich Dost; Johannes Terno; Guntram Scheithauer 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 258 KB

Improvements of the Held—Karp algorithm

✍ Keld Helbig Hansen; Jakob Krarup 📂 Article 📅 1974 🏛 Springer-Verlag 🌐 English ⚖ 485 KB

Transformation of the generalized travel

✍ Yao-Nan Lien; Eva Ma; Benjamin W.-S. Wah 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 843 KB

The landscape of the traveling salesman

✍ Peter F. Stadler; Wolfgang Schnabl 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 539 KB

On the refinement of bounds of heuristic

✍ Bernd Jeromin; Frank Körner 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 184 KB

A new asymmetric pyramidally solvable cl

✍ Mohammed Fazle Baki 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 194 KB