A return to the traveling salesman model: a network branch and bound approach
South African Journal of Economic and Management Sciences
| Field | Value | |
| Title | A return to the traveling salesman model: a network branch and bound approach | |
| Creator | Munapo, Elias | |
| Description | 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. | |
| Publisher | AOSIS Publishing | |
| Date | 2013-02-26 | |
| Identifier | 10.4102/sajems.v16i1.175 | |
| Source | South African Journal of Economic and Management Sciences; Vol 16, No 1 (2013); 52-63 2222-3436 1015-8812 | |
| Language | eng | |
| Relation |
The following web links (URLs) may trigger a file download or direct you to an alternative webpage to gain access to a publication file format of the published article:
https://sajems.org/index.php/sajems/article/view/175/212
|
|
ADVERTISEMENT
