On complexity of a global optimization problem (Q928586)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5287433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On complexity of a global optimization problem |
scientific article; zbMATH DE number 5287433 |
Statements
On complexity of a global optimization problem (English)
0 references
11 June 2008
0 references
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.
0 references
cutting angle method
0 references
dominant subset with minimal weight problem
0 references
NP-complete
0 references
0.9609742
0 references
0.95561075
0 references
0.9293788
0 references
0.92700255
0 references
0.92054665
0 references
0.9147167
0 references
