✦ LIBER ✦

An improved assignment lower bound for the euclidean traveling salesman problem

✍ Scribed by William R Stewart Jr.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient hybrid genetic algorithm fo

✍ Kengo Katayama; Hiroyuki Narihisa 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB 👁 2 views

An improved bounding procedure for the c

✍ Moshe B. Rosenwein 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 566 KB

A new lower bound for the quadratic assi

✍ S.I. Sergeyev 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 549 KB

Heuristics and bounds for the travelling

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

TRAVEL — An interactive travelling sales

✍ S.C. Boyd; W.R. Pulleyblank; G. Cornuéjols 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 344 KB

The optimum assignments and a new heuris

✍ Kabekode V.S. Bhat 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 774 KB