On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679)
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: On the impact of running intersection inequalities for globally solving polynomial optimization problems |
scientific article; zbMATH DE number 7241045
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the impact of running intersection inequalities for globally solving polynomial optimization problems |
scientific article; zbMATH DE number 7241045 |
Statements
On the impact of running intersection inequalities for globally solving polynomial optimization problems (English)
0 references
27 August 2020
0 references
branch-and-cut
0 references
polynomial optimization
0 references
running-intersection inequalities
0 references
multilinear polytope
0 references
separation algorithm
0 references
mixed-integer nonlinear optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.797652542591095
0 references
0.7763986587524414
0 references
0.7484724521636963
0 references
0.7441311478614807
0 references
0.7430552244186401
0 references
