𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach

✍ Scribed by Batista-Galván, María; Riera-Ledesma, Jorge; Salazar-González, Juan José

Book ID
122878688
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
574 KB
Volume
40
Category
Article
ISSN
0305-0548

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

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