A branch and bound algorithm for the robust spanning tree problem with interval data

Computational results obtained by the algorithm are presented. The technique we propose is up to 210 faster than methods recently appeared in the literature.