On complexity of a global optimization problem

DOI10.3390/MCA8010027zbMath1151.90579OpenAlexW2314417323MaRDI QIDQ928586

Urfat G. Nuriyev

Publication date: 11 June 2008

Published in: Mathematical \& Computational Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/mca8010027

zbMATH Keywords

cutting angle methodNP-completedominant subset with minimal weight problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (1)

Computing near-optimal solutions for the dominating subset with minimal weight problem

This page was built for publication: On complexity of a global optimization problem