Lower bounds for the Quadratic Minimum Spanning Tree Problem based on reduced cost computation.

Borzou Rostami Federico Malucelli

Published in: Comput. Oper. Res. (2015)

Keyphrases

lower bound
objective function
optimal cost
upper bound
lower bounding
storage cost
branch and bound algorithm
np hard
cost savings
random accesses
minimal cost
branch and bound
expected cost
efficient computation
cost sensitive
learning algorithm
upper and lower bounds
linear programming
data structure