New curve-tracing algorithm based on a minimum-spanning-tree model and regularized fuzzy clustering

2006 ◽  
Vol 45 (1) ◽  
pp. 017201
Author(s):  
Hong Yan
2013 ◽  
Vol 16 (1) ◽  
pp. 52-63 ◽  
Author(s):  
Elias Munapo

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. 


Sign in / Sign up

Export Citation Format

Share Document