✦ LIBER ✦

Solving the asymmetric traveling purchaser problem

✍ Scribed by Jorge Riera-Ledesma; Juan-José Salazar-González

Book ID: 106344247
Publisher: Springer US
Year: 2006
Tongue: English
Weight: 301 KB
Volume: 144
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-006-0014-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving the asymmetric traveling salesma

Solving the asymmetric traveling salesman problem with periodic constraints

✍ Giuseppe Paletta; Chefi Triki 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

The distance constrained multiple vehicl

The distance constrained multiple vehicle traveling purchaser problem

✍ Bianchessi, N.; Mansini, R.; Speranza, M.G. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 405 KB

Exploring greedy criteria for the dynami

Exploring greedy criteria for the dynamic traveling purchaser problem

✍ E. Angelelli; R. Mansini; M. Vindigni 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 404 KB

Solving school bus routing using the mul

Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach

✍ Jorge Riera-Ledesma; Juan-José Salazar-González 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 284 KB

A branch and bound algorithm for the tra

A branch and bound algorithm for the traveling purchaser problem

✍ Kashi N. Singh; Dirk L. van Oudheusden 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 616 KB

An important generalization of the traveling salesman problem called the traveling purchaser problem is considered. A branch and bound algorithm which solves a related simple plant location problem for calculating the bounds is proposed for this problem. Computational experiments with this algorithm

Approximate algorithms for the travellin

Approximate algorithms for the travelling purchaser problem

✍ Hoon Liong Ong 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 463 KB