𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch-and-bound algorithm for the double travelling salesman problem with two stacks

✍ Scribed by Francesco Carrabs; Raffaele Cerulli; Maria Grazia Speranza

Book ID
112163199
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
672 KB
Volume
61
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