A minimum spanning tree based heuristic for the travelling salesman tour
Year of publication: |
Jan.-Mar. 2018
|
---|---|
Authors: | Kumar, Santosh ; Munapo, Elias ; Lesaoana, Maseka ; Nyamugure, Philimon |
Published in: |
Opsearch : journal of the Operational Research Society of India. - New Delhi : Springer India, ISSN 0030-3887, ZDB-ID 417088-X. - Vol. 55.2018, 1, p. 150-164
|
Subject: | Connected network | Minimum spanning tree path | Travelling salesman tour | Tourenplanung | Vehicle routing problem | Graphentheorie | Graph theory | Heuristik | Heuristics | Rundreiseproblem | Travelling salesman problem |
-
Becker, Kai Helge, (2015)
-
A new heuristic for detecting non-hamiltonicity in cubic graphs
Filar, Jerzy A., (2014)
-
Heuristic algorithms for the 2-period balanced Travelling Salesman Problem in Euclidean graphs
Bassetto, Tatiana, (2011)
- More ...
-
Evans, Dave, (2011)
-
Scheduling with fixed delivery dates
Hall, Nicholas G., (2001)
-
Modelling tail behavior of returns using the generalized extreme value distribution
Makhwiting, Monnye Rhoda, (2014)
- More ...