Linear decomposition approach for a class of nonconvex programming problems (Q523884)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear decomposition approach for a class of nonconvex programming problems |
scientific article; zbMATH DE number 6707522
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear decomposition approach for a class of nonconvex programming problems |
scientific article; zbMATH DE number 6707522 |
Statements
Linear decomposition approach for a class of nonconvex programming problems (English)
0 references
24 April 2017
0 references
nonconvex programming
0 references
global optimization
0 references
linear decomposition approach
0 references
approximation algorithm
0 references
computational complexity
0 references
0 references
0.93986976
0 references
0.93860996
0 references
0.93182796
0 references
0.93093246
0 references
0.92895305
0 references
0.9264479
0 references
0.92171085
0 references
