1887

n South African Journal of Economic and Management Sciences - A network branch and bound approach for the traveling salesman model

USD

 

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.

Loading

Article metrics loading...

/content/ecoman/16/1/EJC131968
2013-01-01
2016-12-07
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error