Geodesic
Building a capacitated minimum spanning tree using simulated annealing
The Bulletin of Irkutsk State University. Series Mathematics, Tome 4 (2011) no. 2, pp. 114-123

Voir la notice de l'article provenant de la source Math-Net.Ru

In this paper we consider capacitated minimum spanning tree problem (CMST) which is NP-hard. We have developed enhanced simulated annealing method, which allows getting better solutions for CMST than the classical one. Computational results on the benchmark instances are reported.
Keywords: capacitated minimum spanning tree; simulated annealing; metaheuristic; neighborhood. 
@article{IIGUM_2011_4_2_a8,
     author = {A. Ipatov},
     title = {Building a capacitated minimum spanning tree using simulated annealing},
     journal = {The Bulletin of Irkutsk State University. Series Mathematics},
     pages = {114--123},
     publisher = {mathdoc},
     volume = {4},
     number = {2},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IIGUM_2011_4_2_a8/}
}
TY  - JOUR
AU  - A. Ipatov
TI  - Building a capacitated minimum spanning tree using simulated annealing
JO  - The Bulletin of Irkutsk State University. Series Mathematics
PY  - 2011
SP  - 114
EP  - 123
VL  - 4
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IIGUM_2011_4_2_a8/
LA  - ru
ID  - IIGUM_2011_4_2_a8
ER  - 
%0 Journal Article
%A A. Ipatov
%T Building a capacitated minimum spanning tree using simulated annealing
%J The Bulletin of Irkutsk State University. Series Mathematics
%D 2011
%P 114-123
%V 4
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IIGUM_2011_4_2_a8/
%G ru
%F IIGUM_2011_4_2_a8
A. Ipatov. Building a capacitated minimum spanning tree using simulated annealing. The Bulletin of Irkutsk State University. Series Mathematics, Tome 4 (2011) no. 2, pp. 114-123. http://geodesic.mathdoc.fr/item/IIGUM_2011_4_2_a8/