๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Using cutting planes to solve the symmetric Travelling Salesman problem

โœ Scribed by P. Miliotis

Publisher
Springer-Verlag
Year
1978
Tongue
English
Weight
452 KB
Volume
15
Category
Article
ISSN
0025-5610

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

Solving a combinatorial problem via self
Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
โœ J. C. Fort ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 586 KB

We present an application of the Kohonen algorithm to the traveling salesman problem: Using only this algorithm, without energy function nor any parameter chosen "ad hoc", we found good suboptimal tours. We give a neural model version of this algorithm, closer to classical neural networks. This is i