1. When the greedy algorithm fails;Bang-Jensen;Discrete Optimization,2004
2. Evolution strategies for solving discrete optimization problems;Cai;Advances in Engineering Software,1996
3. D. Chakrabarty, N.R. Devanur, V.V. Vazirani, New geometry-inspired relaxations and algorithms for the Metric Steiner Tree Problem, in: A. Lodi, A. Panconesi, G. Rinaldi (Eds.), Integer Programming and Combinatorial Optimization: 13th International Conference, IPCO 2008 Bertinoro, 2008 Proceedings, Italy, May 26–28, Springer-Verlag, Berlin, Heidelberg, 2008, pp. 344–358.
4. A greedy heuristic for the set-covering problem;Chvatal;Mathematics of Operations Research,1979
5. Towards Global Optimization,1975