Sciweavers

IJKESDP
2010
149views more  IJKESDP 2010»
13 years 11 months ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...