A hybrid algorithm based on tabu search and ant colony optimization for k-minimum spanning tree problems
暂无分享,去创建一个
Tomohiro Hayashida | Ichiro Nishizaki | Hideki Katagiri | Jun Ishimatsu | I. Nishizaki | H. Katagiri | Tomohiro Hayashida | Qingqiang Guo
[1] R. Ravi,et al. Spanning trees short or small , 1994, SODA '94.
[2] Carlos Eduardo Ferreira,et al. Decomposing Matrices into Blocks , 1998, SIAM J. Optim..
[3] Akhil Kumar,et al. Efficient quorumcast routing algorithms , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.
[4] Horst W. Hamacher,et al. Integer programming approaches tofacilities layout models with forbidden areas , 1998 .
[5] Carlos Eduardo Ferreira,et al. Matrix Decomposition by Branch-and-Cut , 1997 .
[6] Dorit S. Hochbaum,et al. AnO(logk)-approximation algorithm for thek minimum spanning tree problem in the plane , 2006, Algorithmica.
[7] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..
[8] M. Fischetti,et al. Weighted k-cardinality trees , 1992 .
[9] Christian Blum,et al. New metaheuristic approaches for the edge-weighted k-cardinality tree problem , 2005, Comput. Oper. Res..
[10] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.
[11] Matteo Fischetti,et al. Weighted k-cardinality trees: Complexity and polyhedral structure , 1994, Networks.