𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The prize collecting traveling salesman problem

✍ Scribed by Egon Balas

Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
703 KB
Volume
19
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch-and-cut algorithm for the undir
A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
✍ Jean-FranΓ§ois BΓ©rubΓ©; Michel Gendreau; Jean-Yves Potvin πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 130 KB πŸ‘ 1 views

## Abstract Given an undirected graph with edge costs and vertex prizes, the aim of the Prize Collecting Traveling Salesman Problem (PCTSP) is to find a simple cycle minimizing the total edge cost while collecting at least a minimum amount of prizes. In this article, we present a branch‐and‐cut alg

Reoptimizing the traveling salesman prob
Reoptimizing the traveling salesman problem
✍ Claudia Archetti; Luca Bertazzi; M. Grazia Speranza πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 112 KB
The n-line traveling salesman problem
The n-line traveling salesman problem
✍ GΓΌnter Rote πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 780 KB

The special case of the Euclidean traveling salesman problem, where the n given points lie on a small number (N) of parallel lines in the plane, is solved by a dynamic programming approach in time nN, for fixed N, i.e., in polynomial time. This extends a result of Cutler (1980) for three lines. Such