An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems (Q2774597)
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: An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems |
scientific article; zbMATH DE number 1711037
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems |
scientific article; zbMATH DE number 1711037 |
Statements
An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems (English)
0 references
26 February 2002
0 references
branch and cut algorithm
0 references
convex 0-1 mixed integer nonlinear programming
0 references
branch and bound
0 references
outer approximation
0 references
Gomory cutting planes
0 references
primal-dual interior point algorithm
0 references
