A return to the traveling salesman model: a network branch and bound approach
Author:
- Elias MunapoEMElias Munapo
Open Access
- 26 February 2013
- journal article
- Published by AOSIS in South African Journal of Economic and Management Sciences
- Vol. 16 (1) , 52-63
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
This publication has 1 reference indexed in Scilit: