Email this article 
Hide
Show all
Original Research
A return to the traveling salesman model: a network branch and bound approach
South African Journal of Economic and Management Sciences | Vol 16, No 1 | a175 |
DOI: https://doi.org/10.4102/sajems.v16i1.175
| © 2013 Elias Munapo
| This work is licensed under CC Attribution 4.0
Submitted: 07 April 2011 | Published: 26 February 2013
Submitted: 07 April 2011 | Published: 26 February 2013
About the author(s)
Elias Munapo,Full Text:
PDF (2MB)Abstract
This paper presents a network branch and bound approach for solving the traveling salesman problem. The problem is broken into sub-problems, each of which is solved as a minimum spanning tree model. This is easier to solve than either the linear programming-based or assignment models.
Keywords
No related keywords in the metadata.
Metrics
Total abstract views: 3758Total article views: 3499