Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation

@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}
}
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

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

Similar Papers

Loading similar papers…