Author:
Salles da Cunha Alexandre,Simonetti Luidi,Lucena Abilio
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Goemans, M.X.: The Steiner Polytope and Related Polyhedra. Mathematical Programming 63, 157–182 (1994)
2. Huang, B., Liu, N.: Bi-level Programming Approach to Optimizing a Logistic Distribution Network with Balancing Requirements. Transportation Research Record (1894), 188–197 (2004)
3. Kruskal, J.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proceedings of the American Mathematical Society 7, 48–50 (1956)
4. Magnanti, T.L., Wolsey, L.: Optimal Trees. In: Ball, O., et al. (eds.) Handbooks in OR and MS, vol. 7, pp. 503–615. North-Holland, Amsterdam (1995)
5. Mekking, M., Volgenant, A.: Solving the 2-rooted mini-max spanning forest problem by branch-and-bound. European Journal of Operational Research 203(1), 50–58 (2010)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献