Network flow models for designing diameter-constrained minimum-spanning and Steiner trees

@article{Gouveia2003NetworkFM,
  title={Network flow models for designing diameter-constrained minimum-spanning and Steiner trees},
  author={Lu{\'i}s Gouveia and Thomas L. Magnanti},
  journal={Networks},
  year={2003},
  volume={41},
  pages={159-173}
}
The Diameter-Constrained Minimum Spanning Tree Problem seeks a least cost spanning tree subject to a (diameter) bound imposed on the number of edges in the tree between any node pair. A traditional multicommodity flow model with a commodity for every pair of nodes was unable to solve a 20-node and 100-edge problem after one week of computation. We formulate the problem as a directed tree from a selected central node or a selected central edge. Our model simultaneously finds a central node or a… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

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

Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

2008 International Symposium on Applications and the Internet • 2008
View 4 Excerpts
Highly Influenced

Design of Survivable Networks: A survey

View 7 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Parallel Heuristics for the Diameter-Constrained Minimum Spanning Tree Problem," Congressus Numeratium

A. Abdalla, N. Deo, R. Fraceschini
Techniques and Applications, • 1992

Complexity of Spanning Tree Problems: Part I,

P. Camerini, G. Galbiati, F. Maffioli
European Journal of Operational Research, • 1980

Similar Papers

Loading similar papers…