A hybrid algorithm based on simulated annealing and tabu search for k-minimum spanning tree problems

Author(s):  
El houcine ADDOU ◽  
Abelhafid Serghini ◽  
El Bekkaye Mermri
2012 ◽  
Vol 39 (5) ◽  
pp. 5681-5686 ◽  
Author(s):  
Hideki Katagiri ◽  
Tomohiro Hayashida ◽  
Ichiro Nishizaki ◽  
Qingqiang Guo

Sign in / Sign up

Export Citation Format

Share Document