Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints (Q1761747)
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: Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints |
scientific article; zbMATH DE number 6107315
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints |
scientific article; zbMATH DE number 6107315 |
Statements
Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints (English)
0 references
15 November 2012
0 references
nonlinear integer programming
0 references
bounds
0 references
relaxation
0 references
convex hull
0 references
CHR
0 references
QCR
0 references
SDP
0 references
GQAP
0 references
0 references
0 references
