Generating convex polynomial inequalities for mixed 0-1 programs (Q1810867)
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: Generating convex polynomial inequalities for mixed 0-1 programs |
scientific article; zbMATH DE number 1924946
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating convex polynomial inequalities for mixed 0-1 programs |
scientific article; zbMATH DE number 1924946 |
Statements
Generating convex polynomial inequalities for mixed 0-1 programs (English)
0 references
9 June 2003
0 references
Mixed integer programming
0 references
Convex programming
0 references
Semidefinite programming
0 references
Mixed integer nonlinear programming
0 references
Mixed integer convex programming
0 references
0.89280087
0 references
0.89108133
0 references
0.8825451
0 references
0.8756132
0 references
0.87501675
0 references
0.87122303
0 references
