𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On prize-collecting tours and the asymmetric travelling salesman problem

✍ Scribed by Mauro Dell'Amico; Francesco Maffioli; Peter Värbrand

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
722 KB
Volume
2
Category
Article
ISSN
0969-6016

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