𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on the prize collecting traveling salesman problem

✍ Scribed by Daniel Bienstock; Michel X. Goemans; David Simchi-Levi; David Williamson

Publisher
Springer-Verlag
Year
1993
Tongue
English
Weight
452 KB
Volume
59
Category
Article
ISSN
0025-5610

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

The traveling-salesman problem
The traveling-salesman problem
✍ D. A. Suprunenko πŸ“‚ Article πŸ“… 1976 πŸ› Springer US 🌐 English βš– 254 KB