A polyhedral approach for nonconvex quadratic programming problems with box constraints (Q1273053)
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: A polyhedral approach for nonconvex quadratic programming problems with box constraints |
scientific article; zbMATH DE number 1228823
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polyhedral approach for nonconvex quadratic programming problems with box constraints |
scientific article; zbMATH DE number 1228823 |
Statements
A polyhedral approach for nonconvex quadratic programming problems with box constraints (English)
0 references
2 December 1998
0 references
valid inequalities
0 references
linearization
0 references
nonconvex quadratic problems
0 references
box constraints
0 references
cutting plane algorithms
0 references
heuristic
0 references
