Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828)
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 5320577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lago: a (heuristic) branch and cut algorithm for nonconvex minlps |
scientific article; zbMATH DE number 5320577 |
Statements
Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (English)
0 references
3 September 2008
0 references
global optimization
0 references
branch and bound
0 references
branch and cut
0 references
outer approximation
0 references
mixed-integer nonlinear programming
0 references
0 references
0 references
0.8583751916885376
0 references
0.8207583427429199
0 references
0.7981459498405457
0 references
0.797420084476471
0 references
