A Benders decomposition approach for the robust spanning tree problem with interval data

@article{Montemanni2006ABD,
  title={A Benders decomposition approach for the robust spanning tree problem with interval data},
  author={Roberto Montemanni},
  journal={European Journal of Operational Research},
  year={2006},
  volume={174},
  pages={1479-1490}
}
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem edge costs lie in an interval instead of having a fixed value. Interval numbers model uncertainty about the exact cost values. A robust spanning tree is a spanning tree whose total cost minimizes the maximum deviation from the optimal spanning tree over all realizations of the edge costs. This robustness concept is… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Shortest connection networks and some generalizations

  • R. C. Prim
  • Bell System Technical Journal, 36:1389–1401
  • 1957
Highly Influential
4 Excerpts

Performance of various computers using standard linear algebra software in a fortran environment

  • J. J. Dongarra
  • Technical Report CS-89-85,
  • 2003
Highly Influential
2 Excerpts

Similar Papers

Loading similar papers…