𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An approximation algorithm for the asymmetric travelling salesman problem with distances one and two

✍ Scribed by Sundar Vishwanathan

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
501 KB
Volume
44
Category
Article
ISSN
0020-0190

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

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