✦ LIBER ✦

The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms

✍ Scribed by Hipólito Hernández-Pérez; Juan-José Salazar-González

Publisher: John Wiley and Sons
Year: 2007
Tongue: English
Weight: 217 KB
Volume: 50
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20209

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

A branch-and-cut algorithm for the picku

A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

✍ Jean-François Cordeau; Manuel Iori; Gilbert Laporte; Juan José Salazar González 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 1 views

Efficient neighborhood search for the Pr

Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem

✍ Patrizia Beraldi; Gianpaolo Ghiani; Gilbert Laporte; Roberto Musmanno 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

An exact algorithm for the Traveling Sal

An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections

✍ R. Baldacci; E. Hadjiconstantinou; A. Mingozzi 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB 👁 1 views

A branch-and-cut algorithm for the undir

A branch-and-cut algorithm for the undirected selective traveling salesman problem

✍ Gendreau, Michel; Laporte, Gilbert; Semet, Fr�d�ric 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 2 views

The Selective Traveling Salesman Problem (STSP) is defined on a graph in which profits are associated with vertices and costs are associated with edges. Some vertices are compulsory. The aim is to construct a tour of maximal profit including all compulsory vertices and whose cost does not exceed a p