Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints (Q1761747): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10479-011-0969-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977277162 / rank | |||
Normal rank | |||
Revision as of 19:25, 19 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
