A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964)
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 recipe for semidefinite relaxation for (0,1)-quadratic programming |
scientific article; zbMATH DE number 836801
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming |
scientific article; zbMATH DE number 836801 |
Statements
A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (English)
0 references
19 August 1996
0 references
minmax eigenvalue problems
0 references
theta function
0 references
quadratic assignment
0 references
graph partitioning
0 references
max-clique problem
0 references
relaxations of \((0,1)\)-quadratic programming problems
0 references
semidefinite programs
0 references
parametric trust region problems
0 references
concave quadratic maximization
0 references
Lagrangian duality
0 references
0 references
0.93977576
0 references
0.9310875
0 references
0.9246609
0 references
0 references
0.9209686
0 references
0.92096406
0 references
0 references
