A return to the traveling salesman model: a network branch and bound approach

Elias Munapo

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. 

Full Text:

PDF


DOI: http://dx.doi.org/10.4102/sajems.v16i1.175

Submitted: 07 April 2011
Published: 26 February 2013


African Online Scientific Information Systems (Pty) Ltd t/a AOSIS
Reg No: 2002/002017/07
RSA Tel: 086 1000 381
International Tel: +27 21 975 2602
15 Oxford Street, Durbanville, Cape Town, 7550, South Africa
publishing(AT)aosis.co.za replace (AT) with @

All articles published in this journal are licensed under the Creative Commons Attribution 4.0 International (CC BY 4.0) license, unless otherwise stated.
Website design & content: ©2017  AOSIS (Pty) Ltd. All rights reserved. No unauthorised duplication allowed.
By continuing to use this website, you agree to our Privacy Policy.

Subscribe to our newsletter

Get specific, domain-collection newsletters detailing the latest CPD courses, scholarly research and call-for-papers in your field.

Subscribe

South African Journal of Economic and Management Sciences    |    ISSN: 1015-8812 (PRINT)    |    ISSN: 2222-3436 (ONLINE)