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

By /

Requejo, C., Santos, E. (2020). Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms. Operational Research International Journal, 20, 2467–2495. DOI: https://doi.org/10.1007/s12351-018-0426-x

Scroll to Top