An approximate solution method based on tabu search for k-minimum spanning tree problems
by Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishizaki, Jun Ishimatsu
International Journal of Knowledge Engineering and Soft Data Paradigms (IJKESDP), Vol. 2, No. 3, 2010

Abstract: This paper considers a new tabu search-based approximate solution algorithm for k-minimum spanning tree problems. One of the features of the proposed algorithm is that it efficiently obtains local optimal solutions without applying minimum spanning tree algorithms. Numerical experimental results show that the proposed method provides a good performance especially for dense graphs in terms of solution accuracy over existing algorithms.

Online publication date: Fri, 08-Oct-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge Engineering and Soft Data Paradigms (IJKESDP):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com