On complexity of a global optimization problem
Küçük Resim Yok
Tarih
2003
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
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.
Açıklama
Anahtar Kelimeler
Dominant Subset with Minimal Weight-Problem, Global Optimization Problem, Gutting Angle Method, NP-Complete
Kaynak
Mathematical and Computational Applications
WoS Q Değeri
Scopus Q Değeri
N/A
Cilt
8
Sayı
01.Mar
