An approximate solution method based on tabu search for k-minimum spanning tree problems

Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishizaki, Jun Ishimatsu. An approximate solution method based on tabu search for k-minimum spanning tree problems. IJKESDP, 2(3):263-274, 2010. [doi]

Authors

Hideki Katagiri

This author has not been identified. Look up 'Hideki Katagiri' in Google

Tomohiro Hayashida

This author has not been identified. Look up 'Tomohiro Hayashida' in Google

Ichiro Nishizaki

This author has not been identified. Look up 'Ichiro Nishizaki' in Google

Jun Ishimatsu

This author has not been identified. Look up 'Jun Ishimatsu' in Google