Author:
Gouveia Luis,Leitner Markus,Ljubić Ivana
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference23 articles.
1. Achuthan, N.R., Caccetta, L., Caccetta, P., Geelen, J.F.: Computational methods for the diameter restricted minimum weight spanning tree problem. Australas. J. Comb. 10, 51–71 (1994)
2. Botton, Q., Fortz, B., Gouveia, L., Poss, M.: Benders decomposition for the hop-constrained survivable network design problem. INFORMS J. Comput. 25(1), 13–26 (2013)
3. Cherkassky, B.V., Goldberg, A.V.: On implementing push-relabel method for the maximum flow problem. Algorithmica 19, 390–410 (1994)
4. Deo, N., Abdalla, A.: Computing a diameter-constrained minimum spanning tree in parallel. In: Bongiovanni, G.C., et al. (eds.) CIAC, volume 1767 of LNCS, pp. 17–31. Springer, Berlin (2000)
5. Gouveia, L., Magnanti, T.L.: Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. Networks 41(3), 159–173 (2003)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献