✦ LIBER ✦

A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems

✍ Scribed by J. F. Pekny; D. L. Miller

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Results from a parallel branch and bound

✍ D.L. Miller; J.F. Pekny 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 492 KB

Computational implementation of a combin

✍ I.Kh. Sigal 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 588 KB

An algorithm for solving large-scale tra

✍ I.Kh. Sigal 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 543 KB

Solving the Asymmetric Travelling Salesm

✍ Norbert Ascheuer; Matteo Fischetti; Martin Grötschel 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 290 KB

A parallel 2-opt algorithm for the Trave

✍ M.G.A. Verhoeven; E.H.L. Aarts; P.C.J. Swinkels 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 823 KB

A branch-and-bound algorithm for solving

✍ Patrick G. McKeown 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 616 KB