Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
