SciELO - Scientific Electronic Library Online

 
vol.16 issue1The determinants of public expenditure and expenditure on education in particular in a selection of African countriesMaking sense of the disclosure of latent defects in financial statements and company acquisition contracts author indexsubject indexarticles search 		Home Pagealphabetic serial listing  

Services on Demand

Article

Indicators

Related links

  • On index processCited by Google
  • On index processSimilars in Google

Share

South African Journal of Economic and Management Sciences

On-line version ISSN 2222-3436
Print version ISSN 1015-8812

Abstract

MUNAPO, Elias. A network branch and bound approach for the traveling salesman model. S. Afr. j. econ. manag. sci. [online]. 2013, vol.16, n.1, pp.52-63. ISSN 2222-3436.

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.

Keywords : NP hard; traveling salesman problem; spanning tree; branch and bound method.

        · text in English     · English ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License

AOSIS Publishing
15 Oxford Street, Durbanville, Cape Town, Western Cape Province, ZA, 7550,
Tel: +27 21 975 2602