𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The selective travelling salesman problem

✍ Scribed by Gilbert Laporte; Silvano Martello

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
831 KB
Volume
26
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A tabu search heuristic for the undirect
A tabu search heuristic for the undirected selective travelling salesman problem
✍ Michel Gendreau; Gilbert Laporte; FrΓ©dΓ©ric Semet πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 677 KB

The undirected Selective Travelling Salesman Problem (STSP) is defined on a graph G= ( V, E) with positive profits associated with vertices, and distances associated with edges. The STSP consists of determining a maximal profit Hamiltonian cycle over a subset of V whose length does not exceed a pres

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