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

A multiperiod traveling salesman problem: Heuristic algorithms

โœ Scribed by G. Paletta


Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
687 KB
Volume
19
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A heuristic circulation-network approach
โœ 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