On Complexity of a Global Optimization Problem
Articles > Article · 2003
Authors: Urfat NURİYEV
Mathematical and Computational Applications, International, Scopus, 2003, vol 8, pp 27-34
DOI: 10.3390/mca8010027
Summary
The 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.