Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints (Q1761747): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:36, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints |
scientific article |
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
