HIGHLIGHTS
- who: Louise Oberholster from the Graduate School of Business and Leadership, University of KwaZulu-Natal have published the Article: A N B, in the Journal: (JOURNAL)
- what: In this paper an exact branch and bound approach is proposed.
- how: This paper presents a network branch and bound approach for solving the traveling salesman problem.
SUMMARY
The traveling salesman problem (TSP) is one of the NP hard problems that are of concern to researchers. The matrix C=(cij ) N × N is the distance or weight matrix, where the (i, j . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.