𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The pickup and delivery problem: Faces and branch-and-cut algorithm

✍ Scribed by K.S. Ruland; E.Y. Rodin

Book ID
108458702
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
633 KB
Volume
33
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Models and branch-and-cut algorithms for
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
✍ Stefan Ropke; Jean-FranΓ§ois Cordeau; Gilbert Laporte πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 175 KB πŸ‘ 1 views

## Abstract In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destinations. In addition to capacity and time window constraints, vehicle routes must also satisfy pairing and precede

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