View in EDS HTML Full Text PDF Full Text

Regularized standard polynomial programming formulations for the maximum clique problem.

Saved in:
Bibliographic Details
Title: Regularized standard polynomial programming formulations for the maximum clique problem.
Authors: Makovenko, Mykyta1, makovenko@tamu.edu, Butenko, Sergiy1, butenko@tamu.edu, Pardalos, Miltiades1, apardalos@tamu.edu
Source: Computational Optimization & Applications; Dec2025, Vol. 92 Issue 3, p923-949, 27p
Database: Applied Science & Technology Source
Full text is not displayed to guests.
Description
ISSN:09266003
DOI:10.1007/s10589-025-00674-z