Makovenko, M., Butenko, S., & Pardalos, M. (2025). Regularized standard polynomial programming formulations for the maximum clique problem. Computational Optimization & Applications, 92(3), 923. https://doi.org/10.1007/s10589-025-00674-z
Chicago Style (17th ed.) CitationMakovenko, Mykyta, Sergiy Butenko, and Miltiades Pardalos. "Regularized Standard Polynomial Programming Formulations for the Maximum Clique Problem." Computational Optimization & Applications 92, no. 3 (2025): 923. https://doi.org/10.1007/s10589-025-00674-z.
MLA (9th ed.) CitationMakovenko, Mykyta, et al. "Regularized Standard Polynomial Programming Formulations for the Maximum Clique Problem." Computational Optimization & Applications, vol. 92, no. 3, 2025, p. 923, https://doi.org/10.1007/s10589-025-00674-z.