Computing tight bounds via piecewise linear functions through the example of circle cutting problems (Q328518)
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: Computing tight bounds via piecewise linear functions through the example of circle cutting problems |
scientific article; zbMATH DE number 6641430
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing tight bounds via piecewise linear functions through the example of circle cutting problems |
scientific article; zbMATH DE number 6641430 |
Statements
Computing tight bounds via piecewise linear functions through the example of circle cutting problems (English)
0 references
20 October 2016
0 references
piecewise linear functions
0 references
circle cutting
0 references
non-convex optimization
0 references
global optimization
0 references
nonlinear programming
0 references
quadratically constrained programming
0 references
mixed integer linear programming
0 references
outer approximation
0 references
inner approximation
0 references
incremental formulation
0 references
logarithmic formulation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.85775363
0 references
0 references
0.85437214
0 references
0.85239685
0 references
0.8494479
0 references
0.84439564
0 references
0.84137106
0 references
