A. Bookstein and S. T. Klein, Compression of correlated bit-vectors, Information Systems, vol.16, issue.4, pp.387-400, 1991.
DOI : 10.1016/0306-4379(91)90030-D

M. N. Gomes, R. C. Andrade, C. P. Santiago, and N. Maculan, Spanning tree algorithms to some hard combinatorial problems, Proceedings of Optimization Days, pp.83-84, 1997.

M. Gruber, J. I. Van-hemert, and G. R. , Neighborhood searches for the bounded diameter minimum spanning tree problem embedded in a vns, ea, and aco, Proceedings of the Genetic and Evolutionary Computation Conference, pp.1187-1194, 2006.

P. Van, H. , and L. Michel, Constraint-based local search, 2005.

B. A. Julstrom, Greedy heuristics for the bounded diameter minimum spanning tree problem, Journal of Experimental Algorithmics, vol.14, 2004.
DOI : 10.1145/1498698.1498699

J. Knowles and D. Corne, A new evolutionary approach to the degree-constrained minimum spanning tree problem, IEEE Transactions on Evolutionary Computation, vol.4, issue.2, pp.125-134, 2000.
DOI : 10.1109/4235.850653

M. Krishnamoorthy, Y. M. Sharaiha-andreas, and T. Ernst, Comparison of algorithms for the degree constrained minimum spanning tree, Journal of Heuristics, vol.6, pp.587-611, 2001.

M. Krishnamoorthy, A. T. Ernst, and Y. M. Sharaiha, Comparison of algorithms for the degree constrained minimum spanning tree, Journal of Heuristics, pp.587-611, 2001.

L. Foulds, H. Hamacher, and W. J. , Integer Programming Approaches to Facilities Layout Models with Forbidden Areas, Annals of Operations Research, vol.81, pp.405-417, 1998.
DOI : 10.1007/978-3-642-58891-4_13

A. P. Lucane and J. E. Beasley, Advances in linear and integer programming, Oxford Lecture Series in Mathematics and its Applications, 1996.

E. Nardelli and G. Proietti, Finding all the best swaps of a minimum diameter spanning tree under transient edge failures [18] Kerry Raymond. A tree-based algorithm for distributed mutual exclusion, Journal of Graph Algorithms and Applications ACM Trans. Comput. Syst, vol.5, issue.71, pp.39-5761, 1989.

M. Reimann and M. Laumanns, A hybrid aco algorithm for the capacitated minimum spanning tree problem, Proceedings of First International Workshop on Hybrid Metaheuristics, pp.1-10, 2004.

A. Singh and A. K. Gupta, Improved heuristics for the bounded-diameter minimum spanning tree problem. Soft Computing -A Fusion of Foundations, Methodologies and Applications, pp.911-921, 2006.

M. C. Souza and C. C. Ribeiro, Variable neighborhood search for the degree-constrained minimum spanning tree problem, Discrete Appl. Math, vol.118, pp.43-54, 2002.

A. Volgenant, A Lagrangean approach to the degree-constrained minimum spanning tree problem, European Journal of Operational Research, vol.39, issue.3, pp.325-331, 1989.
DOI : 10.1016/0377-2217(89)90169-0

M. Zachariasen, Local search for the Steiner tree problem in the Euclidean plane, European Journal of Operational Research, vol.119, issue.2, pp.282-300, 1999.
DOI : 10.1016/S0377-2217(99)00131-9

G. Zhou and M. Gen, A note on genetic algorithms for degree-constrained spanning tree problems, Networks, vol.30, issue.2, pp.91-95, 1997.
DOI : 10.1002/(SICI)1097-0037(199709)30:2<91::AID-NET3>3.0.CO;2-F