𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Branch-And-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem

✍ Scribed by Matteo Fischetti, Juan José Salazar González and Paolo Toth

Book ID
111868238
Publisher
INFORMS
Year
1997
Tongue
English
Weight
855 KB
Volume
45
Category
Article
ISSN
0030-364X

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

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