✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
The solution of this problem is also NP-Complete.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez: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.
📊
Temel Bulgular & Veri:For the proof of this fact we formulate another problem which we call "Dominating Subset with Minimal Weight".
💡
Sonuç & Katkı:The solution of this problem is also NP-Complete.
🔬Tür:Modelleme & Sayısal Simülasyon
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Alan Parametreleri
Abstract
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.
🔖
Bu Makaleye Atıf Yap
NURİYEV, U. G. (2003). On complexity of a global optimization problem. Mathematical and Computational Applications, Cilt: 8 - Sayı: 1, 27–34. https://ajindex.com/articles/280354