Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions (Q1892595)
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: Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions |
scientific article; zbMATH DE number 765201
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions |
scientific article; zbMATH DE number 765201 |
Statements
Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions (English)
0 references
25 July 1995
0 references
adaptive bisection
0 references
convergent decomposition branch-and-bound algorithms
0 references
bilinear programming
0 references
0 references
0 references
0 references
0.93935037
0 references
0.93182796
0 references
0.9174446
0 references
0.91507065
0 references
