𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simple Algorithms for Gilmore–Gomory's Traveling Salesman and Related Problems

✍ Scribed by George L. Vairaktarakis

Book ID
111558497
Publisher
Springer US
Year
2003
Tongue
English
Weight
225 KB
Volume
6
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Differential approximation results for t
Differential approximation results for the traveling salesman and related problems
✍ Jérôme Monnot 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 90 KB

This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and cannot be differential approximable greater than 649/650. Next, we demonstrate that, when dealing with edge-costs 1 and 2, the same algorithm ide

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 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