𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The optimum assignments and a new heuristic approach for the traveling salesman problem

✍ Scribed by Kabekode V.S. Bhat

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
774 KB
Volume
27
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A heuristic circulation-network approach
A heuristic circulation-network approach to solve the multi-traveling salesman problem
✍ Alberto Garcia-Diaz πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 561 KB

The overall methodology developed in this paper can be organized into two major parts. The first part consists of a representation of the Multi-Traveling Salesman Problem as a network circulation model. The second part is a subtour elimination procedure. The circulation-network representation of the

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