Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts (Q5158763)
From MaRDI portal
scientific article; zbMATH DE number 7414055
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts |
scientific article; zbMATH DE number 7414055 |
Statements
Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts (English)
0 references
26 October 2021
0 references
convex MINLP
0 references
feasible rounding
0 references
granularity
0 references
inner parallel set
0 references
cutting planes
0 references
extended cutting plane algorithm
0 references
global error bound
0 references
outer approximation
0 references
0 references
0 references
0 references
0 references
0 references
