A return to the traveling salesman model: a network branch and bound approach
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.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AOSIS
2013-02-01
|
| Series: | South African Journal of Economic and Management Sciences |
| Online Access: | https://sajems.org/index.php/sajems/article/view/175 |