Original Research

A return to the traveling salesman model: a network branch and bound approach

Elias Munapo
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

Full Text:

PDF (2MB)

Share this article

Bookmark and Share

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: 1388
Total article views: 2635

 

Crossref Citations

1. A minimum spanning tree based heuristic for the travelling salesman tour
Santosh Kumar, Elias Munapo, ‘Maseka Lesaoana, Philimon Nyamugure
OPSEARCH  vol: 55  issue: 1  first page: 150  year: 2018  
doi: 10.1007/s12597-017-0318-5