Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs (Q2784422)
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: Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs |
scientific article; zbMATH DE number 1732313
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs |
scientific article; zbMATH DE number 1732313 |
Statements
23 April 2002
0 references
binary quadratic programs
0 references
MAX-CUT and MAX-BISECTION
0 references
semidefinite relaxation
0 references
rank-two relaxation
0 references
continuous optimization heuristics
0 references
0.89657944
0 references
0.8817675
0 references
0.87885094
0 references
0.87551284
0 references
0.87179965
0 references
Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs (English)
0 references
