A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01100205 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2912475851 / rank | |||
Normal rank | |||
Revision as of 10:33, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming |
scientific article |
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
