✦ LIBER ✦

A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem

✍ Scribed by Kavindra Malik; Marshall L. Fisher

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for the sym

✍ Ton Volgenant; Roy Jonker 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 538 KB

A modification of the algorithm for solv

✍ L.N. Volovik; B.Ya. Skachek 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 730 KB

A worst-case analysis of two approximate

✍ Giovanni Righini; Marco Trubian 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 251 KB

Computational implementation of a combin

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

An algorithm for the approximate solutio

✍ I.Kh. Sigal 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 362 KB