✦ LIBER ✦

Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem

✍ Scribed by Ton Volgenant; Roy Jonker

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Algorithm for the Traveling Salesman

✍ Little, John D. C.; Murty, Katta G.; Sweeney, Dura W.; Karel, Caroline 📂 Article 📅 1963 🏛 INFORMS 🌐 English ⚖ 733 KB

An Algorithm for the Traveling Salesman

✍ John D. C. Little, Katta G. Murty, Dura W. Sweeney and Caroline Karel 📂 Article 📅 1963 🏛 INFORMS 🌐 English ⚖ 497 KB

An Algorithm for the Bottleneck Travelin

✍ Giorgio Carpaneto, Silvano Martello and Paolo Toth 📂 Article 📅 1984 🏛 INFORMS 🌐 English ⚖ 319 KB

A comparison of lower bounds for the sym

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

An Effective Heuristic Algorithm for the

✍ Lin, S.; Kernighan, B. W. 📂 Article 📅 1973 🏛 INFORMS 🌐 English ⚖ 743 KB

An Effective Heuristic Algorithm for the

✍ S. Lin and B. W. Kernighan 📂 Article 📅 1973 🏛 INFORMS 🌐 English ⚖ 509 KB