A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem

Sergiy Butenko, Mykyta Makovenko, Panos M. Pardalos. A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem. SIAM Journal on Optimization, 32(3):2102-2128, September 2022. [doi]

Authors

Sergiy Butenko

This author has not been identified. Look up 'Sergiy Butenko' in Google

Mykyta Makovenko

This author has not been identified. Look up 'Mykyta Makovenko' in Google

Panos M. Pardalos

This author has not been identified. Look up 'Panos M. Pardalos' in Google