1. Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universität Berlin, Germany (2007)
2. Andrade, C.E., Ahmed, S., Nemhauser, G.L., Shao, Y.: A hybrid primal heuristic for finding feasible solutions to mixed integer programs. European Journal of Operational Research 263(1), 62–71 (2017)
3. Berthold, T., Lodi, A., Salvagnin, D.: Ten years of feasibility pump, and counting. EURO Journal on Computational Optimization 7(1), 1–14 (2019)
4. Blum, C.: Advocating CMSA as a baseline algorithm for algorithm comparison in combinatorial optimization. In: Proceedings of InCITe 2024 – 4th International Conference on Information Technology, Lecture Notes in Electrical Engineering. Springer Nature Singapore (2024). In press
5. Blum, C., Gambini Santos, H.: Generic CP-supported CMSA for binary integer linear programs. In: M.J. Blesa Aguilera, C. Blum, H. Gambini Santos, P. Pinacho-Davidson, J. Godoy del Campo (eds.) Proceedings of 11th International Workshop on Hybrid Metaheuristics – HM 2019, pp. 1–15. Springer International Publishing, Cham (2019)