𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A cutting plane procedure for the travelling salesman problem on road networks

✍ Scribed by Bernhard Fleischmann

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
869 KB
Volume
21
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A diagonal completion and 2-optimal proc
A diagonal completion and 2-optimal procedure for the travelling salesman problem
✍ J.R. King; X.Y. Zhang; G.H. Jin πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 934 KB

A fast diagonal completion algorithm is developed for constructing a good initial feasible solution for travelling salesman problems. The algorithm can be combined with any tour improvement approach but is specifically considered here in conjunction with the 2-optimal method which is shown to give g

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