Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Feremans, C.: Generalized Spanning Trees and Extensions. PhD thesis, Universite Libre de Bruxelles (2001)
2. Fredkin, E.: Trie memory. Communications of the ACM 3, 490–499 (1960)
3. Ghosh, D.: Solving medium to large sized Euclidean generalized minimum spanning tree problems. Technical Report NEP-CMP-2003-09-28, Indian Institute of Management, Research and Publication Department, Ahmedabad, India (2003)
4. Golden, B., Raghavan, S., Stanojevic, D.: Heuristic search for the generalized minimum spanning tree problem. INFORMS Journal on Computing 17(3), 290–304 (2005)
5. Hu, B., Leitner, M., Raidl, G.R.: Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. Journal of Heuristics 14(5), 473–499 (2008)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献