✦ LIBER ✦

Approximation algorithms for the maximum 2-peripatetic salesman problem

✍ Scribed by Gimadi, E. Kh.; Ivonina, E. V.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the generalized 2-peripatetic salesma

✍ J.B.J.M. De Kort; A. Volgenant 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 432 KB

Approximation algorithms for solving the

✍ E. Kh. Gimadi; Yu. V. Glazkov; A. N. Glebov 📂 Article 📅 2009 🏛 Pleiades Publishing 🌐 English ⚖ 650 KB

A branch and bound algorithm for symmetr

✍ Jeroen B.J.M. De Kort 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 1015 KB

Approximation algorithms for the traveli

✍ Jérôme Monnot; Vangelis Th. Paschos; Sophie Toulouse 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 200 KB

Branch-and-cut algorithms for the undire

✍ Éric Duchenne; Gilbert Laporte; Frédéric Semet 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 294 KB

Deterministic approximation algorithms f

✍ van Zuylen, Anke 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 832 KB