Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008)
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: Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation |
scientific article |
Statements
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (English)
0 references
11 August 2021
0 references
unconstrained binary polynomial programming
0 references
global optimization
0 references
semi-definite programming
0 references
quadratic convex reformulation
0 references
0 references
0 references
0 references
0 references
0.8113940358161926
0 references
0.796968400478363
0 references
0.7855502963066101
0 references
0.7714141011238098
0 references
0.7708861827850342
0 references
