𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient heuristic algorithm for the bottleneck traveling salesman problem

✍ Scribed by Ravi Ramakrishnan; Prabha Sharma; Abraham P. Punnen

Book ID
107668804
Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
407 KB
Volume
46
Category
Article
ISSN
0030-3887

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An efficient composite heuristic for the
An efficient composite heuristic for the symmetric generalized traveling salesman problem
✍ Jacques Renaud; Fayez F. Boctor πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 1014 KB

The main purpose of this paper is to introduce a new composite heuristic for solving the generalized traveling salesman problem. The proposed heuristic is composed of three phases: the construction of an initial partial solution, the insertion of a node from each non-visited node-subset, and a solut