✦ LIBER ✦

On the refinement of bounds of heuristic algorithms for the traveling salesman problem

✍ Scribed by Bernd Jeromin; Frank Körner

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristics and bounds for the travelling

✍ D Simchi-Levi; O Berman 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 540 KB

Genetic algorithms for the traveling sal

✍ Károly F. Pál 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 787 KB

Genetic algorithms for the traveling sal

✍ Károly F. Pál 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 787 KB

A note on heuristics for the traveling s

✍ Gianfranco d'Atri 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 208 KB

A new heuristic for the period traveling

✍ I-Ming Chao; Bruce L. Golden; Edward A. Wasil 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 668 KB

A multistart heuristic for the equality

✍ Valentina Cacchiani; Albert Einstein Fernandes Muritiba; Marcos Negreiros; Paolo 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB