𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation algorithms for the capacitated plant allocation problem

✍ Scribed by Martine Labbé; E.F. Schmeichel; S.Louis Hakimi

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
510 KB
Volume
15
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for the capacit
Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
✍ Shoshana Anily; Julien Bramel 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB 👁 2 views

We consider the Capacitated Traveling Salesman Problem with Pickups and Deliveries (CTSPPD). This problem is characterized by a set of n pickup points and a set of n delivery points. A single product is available at the pickup points which must be brought to the delivery points. A vehicle of limited