Convex reformulation for binary quadratic programming problems via average objective value maximization (Q2018868)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convex reformulation for binary quadratic programming problems via average objective value maximization |
scientific article |
Statements
Convex reformulation for binary quadratic programming problems via average objective value maximization (English)
0 references
25 March 2015
0 references
binary quadratic programming
0 references
lower bounds
0 references
branch-and-bound
0 references
convex reformulation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
