A polyhedral branch-and-cut approach to global optimization (Q1780949)
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: A polyhedral branch-and-cut approach to global optimization |
scientific article; zbMATH DE number 2175962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polyhedral branch-and-cut approach to global optimization |
scientific article; zbMATH DE number 2175962 |
Statements
A polyhedral branch-and-cut approach to global optimization (English)
0 references
14 June 2005
0 references
Mixed-integer nonlinear programming
0 references
Outer approximation
0 references
Convexification
0 references
Factorable programming
0 references
Convexity identification
0 references
0 references
0 references
0 references
0 references
0 references
0.8336208462715149
0 references
0.8304004669189453
0 references
0.828464150428772
0 references
0.8076059222221375
0 references
0.8030030131340027
0 references
