1. Johnson, D.S., Minkoff, M., Phillips, S.: The prize collecting Steiner tree problem: theory and practice. In: Proceeding of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, USA, pp. 760–769 (2000)
2. Canuto, S.A., Resende, M.G.C., Ribeiro, C.C.: Local search with perturbations for the prize collecting Steiner tree problem in graphs. Networks 38, 50–58 (2001)
3. Goldbarg, E.F.G., Goldbarg, M.C., Schmidt, C.C.: A hybrid transgenetic algorithm for the prize collecting Steiner tree problem. J. Univers. Comput. Sci. 14, 2491–2511 (2008)
4. Akhmedov, M., Kwee, I., Montemanni, R.: A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem. Comput. Oper. Res. 70, 18–25 (2016)
5. Fu, Z.H., Hao, J.K.: Knowledge-guided local search for the prize-collecting Steiner tree problem in graphs. Knowl.-Based Syst. 128, 78–92 (2017)