𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The euclidean traveling salesman problem and a space-filling curve

✍ Scribed by Michael G. Norman; Pablo Moscato

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
499 KB
Volume
6
Category
Article
ISSN
0960-0779

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the expected number of optimal and ne
On the expected number of optimal and near-optimal solutions to the Euclidean travelling salesman problem
✍ Selim G. Akl πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 138 KB

An algorithm for empirically calculating the expected number of optimal and near-optimal solutions in a random Euclidean travelling salesman problem is presented. The algorithm is based on well known geometric properties of the optimal tour. For problems involving up to 15 points uniformily distribu

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