Author:
Simonetti Luidi,da Cunha Alexandre Salles,Lucena Abilio
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference35 articles.
1. Awerbuch, B., Azar, Y., Blum, A., Vempala, S.: Improved approximation guarantees for minimum weight k-trees and prize-collecting salesmen. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, ACM Press, pp. 277–283 (1995)
2. Beasley, J.E.: An SST-based Algorithm for the Steiner Problem in Graphs. Networks 19, 1–16 (1989)
3. Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069–1072 (1990)
4. Blesa, M.J., Xhafa, F.: A C++ implementation of Tabu search for v-cardinality tree problem based on generic programming and component reuse. In. Net. Object. Days 2000, 648–652 (2000)
5. Blum, C.: Revisiting dynamic programming for finding optimal subtrees in trees. Eur. J. Oper. Res. 177, 102–115 (2007)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献