Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms

Cristina Requejo, Eulália Santos. Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms. Operational Research, 20(4):2467-2495, 2020. [doi]

@article{RequejoS20,
  title = {Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms},
  author = {Cristina Requejo and Eulália Santos},
  year = {2020},
  doi = {10.1007/s12351-018-0426-x},
  url = {https://doi.org/10.1007/s12351-018-0426-x},
  researchr = {https://researchr.org/publication/RequejoS20},
  cites = {0},
  citedby = {0},
  journal = {Operational Research},
  volume = {20},
  number = {4},
  pages = {2467-2495},
}