𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The one-commodity pickup and delivery travelling salesman problem on a path or a tree

✍ Scribed by Fan Wang; Andrew Lim; Zhou Xu

Publisher
John Wiley and Sons
Year
2006
Tongue
English
Weight
503 KB
Volume
48
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-cut algorithm for the picku
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
✍ Jean-François Côté; Claudia Archetti; Maria Grazia Speranza; Michel Gendreau; Je 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB 👁 1 views

This article studies the pickup and delivery traveling salesman problem with multiple stacks. The vehicle contains a number of (horizontal) stacks of finite capacity for loading items from the rear of the vehicle. Each stack must satisfy the last-in-first-out constraint that states that any new item