1. Alidaee, B., Kochenberger, G., Lewis, K., Lewis, M., Wang, H.: Computationally attractive non-linear models for combinatorial optimization. Int. J. Math. OR. 1, 9–19 (2009)
2. Bouamama, S., Blum, C., Boukerram, A.: Population-based iterated Greedy algorithm for the minimum weight vertex cover problem. A Appl. Soft Comput. 121, 632–1639 (2012)
3. Cai, S., K. Su, Chen, Q.: EWLS: a new local search for minimum vertex cover. In: Proceedings of the 24 $$^{th}$$ t h AAAI Conference on Artificial Intelligence. pp. 45–50 (2010)
4. Cai, S., Su, K., Sattar, A.: Two new local search strategies for minimum vertex cover. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence. pp. 441–447 (2012)
5. Cygan, M., Pilipczuk, M.: Split vertex deletion meets vertex cover: new fixed-parameter and exact exponential-time algorithms. Inf. Process. Lett. 113, 179–182 (2013)