Reformulations for utilizing separability when solving convex MINLP problems (Q721170)
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: Reformulations for utilizing separability when solving convex MINLP problems |
scientific article; zbMATH DE number 6905234
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reformulations for utilizing separability when solving convex MINLP problems |
scientific article; zbMATH DE number 6905234 |
Statements
Reformulations for utilizing separability when solving convex MINLP problems (English)
0 references
18 July 2018
0 references
convex MINLP
0 references
lifted polyhedral approximation
0 references
separable MINLP
0 references
extended cutting plane algorithm
0 references
extended supporting hyperplane algorithm
0 references
outer approximation
0 references
0 references
