Author:
Gouveia Luis,Leitner Markus,Ljubić Ivana
Publisher
Springer Nature Switzerland
Reference36 articles.
1. Achuthan, N. R., Caccetta, L., Caccetta, P., & Geelen, J. F. (1994). Computational methods for the diameter restricted minimum weight spanning tree problem. Australasian Journal of Combinatorics, 10, 51–72.
2. Bahiense, L., Maculan, N., & Sagastizábal, C. (2002). The volume algorithm revisited: Relation with bundle methods. Mathematical Programming, 94, 41–69.
3. Bahiense, L., Besso, A., Tostas, R., & Maculan, N. (2021). Using multiflow formulations to solve the Steiner tree problem in graphs. RAIRO-Operations Research, 55, S343–S350.
4. Balakrishnan, A., Magnanti, T. L., & Wong, R. T. (1989). A dual-ascent procedure for large-scale uncapacitated network design. Operations Research, 37(5), 716–740.
5. Binh, H. T. T, McKay, R. I., Hoai, N. X., & Nghia, n.d. (2009). New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem. In F. Rothlauf (Ed.), Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, July 8–12, 2009 (pp. 373–380). ACM.