Convex reformulation for binary quadratic programming problems via average objective value maximization (Q2018868)
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: Convex reformulation for binary quadratic programming problems via average objective value maximization |
scientific article; zbMATH DE number 6419586
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex reformulation for binary quadratic programming problems via average objective value maximization |
scientific article; zbMATH DE number 6419586 |
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
