## A biased random-key genetic algorithm for the capacitated minimum spanning tree problem

- Efrain Ruiz, Maria Albareda-Sambola, Elena Fernández, Mauricio G. C. Resende
- Computers & OR
- 2015

Highly Influenced

@article{Uchoa2008RobustBF, title={Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation}, author={Eduardo Uchoa and Ricardo Fukasawa and Jens Lysgaard and Artur Alves Pessoa and Marcus Poggi de Arag{\~a}o and Diogo Andrade}, journal={Math. Program.}, year={2008}, volume={112}, pages={443-472} }

- Published 2008 in Math. Program.
DOI:10.1007/s10107-006-0043-y

This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation of the capacitated prize-collecting arborescence problem in order to make it solvable in pseudo-polynomial time. Traditional inequalities over the arc formulation, like Capacity Cuts, are also used. Moreover, a novel feature is introduced in such kind of algorithms. Powerful new cuts expressed over… CONTINUE READING

26 Citations

38 References

Similar Papers