Acta mathematica scientia,Series B ›› 1994, Vol. 14 ›› Issue (2): 139-145.
• Articles • Previous Articles Next Articles
Xu Xusong
Received:
Online:
Published:
Abstract: This paper provides a branch-and-bound algorithm for seeking the best touring-path. Using the reduction method, this algorithm found cost low-limits of a set of the paths. As a branch-node, the live node having minimum low-limit has been expanded and a state space tree has been generated. The best touring-path has been found. Moreover, combining algorithm with data structure, the author studied many details about this problem, and gave its computer implementation.
Xu Xusong. A BRANCH-AND-BOUND ALGORITHM IN THE TOURING-PATH PROBLEM AND ITS COMPUTER IMPLEMENTATION[J].Acta mathematica scientia,Series B, 1994, 14(2): 139-145.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: http://121.43.60.238/sxwlxbB/EN/
http://121.43.60.238/sxwlxbB/EN/Y1994/V14/I2/139
Cited