Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

On solving the maximum clique problem

From MaRDI portal
Publication:1850827
Jump to:navigation, search

DOI10.1023/A:1012395712371zbMath1071.90033OpenAlexW1552249563MaRDI QIDQ1850827

Antonina Kuznetsova, Alexander S. Strekalovsky

Publication date: 15 December 2002

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1012395712371



zbMATH Keywords

local searchlinearized problemglobal optimality conditionsglobal search algorithmd.c. maximization


Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Search theory (90B40)



Related Items (3)

On a continuous approach for the maximum weighted clique problem ⋮ A General Regularized Continuous Formulation for the Maximum Clique Problem ⋮ Hard graphs for the maximum clique problem





This page was built for publication: On solving the maximum clique problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1850827&oldid=14233277"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 12:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki