Login / Signup
Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms.
Cristina Requejo
Eulália Santos
Published in:
Oper. Res. (2020)
Keyphrases
</>
lower and upper bounds
upper and lower bounds
upper bound
lower bound
computationally expensive
exact and approximate
straight forward
lagrangian relaxation
learning algorithm
computationally efficient
real world
special case
computationally intensive
efficient solutions
relaxation algorithm