On Complexity of a Global Optimization Problem
AbstractThe Solution of the Subproblem of the Cutting Angle Method of Global Optimization for problems of minimizing increasing Positively Homogeneous of degree one functions is proved to be NP-Complete. For the proof of this fact we formulate another problem which we call "Dominating Subset with Minimal Weight". The solution of this problem is also NP-Complete.
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Nuriyev, U.G. On Complexity of a Global Optimization Problem. Math. Comput. Appl. 2003, 8, 27-34.
Nuriyev UG. On Complexity of a Global Optimization Problem. Mathematical and Computational Applications. 2003; 8(1):27-34.Chicago/Turabian Style
Nuriyev, Urfat G. 2003. "On Complexity of a Global Optimization Problem." Math. Comput. Appl. 8, no. 1: 27-34.