A dynamic inequality generation scheme for polynomial programming (Q263184)
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: A dynamic inequality generation scheme for polynomial programming |
scientific article; zbMATH DE number 6562684
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dynamic inequality generation scheme for polynomial programming |
scientific article; zbMATH DE number 6562684 |
Statements
A dynamic inequality generation scheme for polynomial programming (English)
0 references
4 April 2016
0 references
polynomial programming
0 references
binary polynomial programming
0 references
semidefinite programming
0 references
inequality generation
0 references
0 references
0 references
0 references
0 references
0 references
0.8943922519683838
0 references
0.765119194984436
0 references
0.7579112648963928
0 references
0.7566524744033813
0 references
0.7552515864372253
0 references
