South African Journal of Economic and Management Sciences, Vol 16, No 1 (2013)

Font Size:  Small  Medium  Large

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

Elias Munapo

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. 

Full Text: PDF

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/).

EISSN 2222-3436 (Online)