Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology (Q2931718)
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: Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology |
scientific article; zbMATH DE number 6374339
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology |
scientific article; zbMATH DE number 6374339 |
Statements
SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (English)
0 references
26 November 2014
0 references
combinatorial optimization
0 references
integer programming
0 references
binary quadratic programming
0 references
semidefinite programming
0 references
doubly non-negative relaxation
0 references
computational biology
0 references
protein folding
0 references
protein similarity
0 references
rotamer assignment
0 references
contact map overlap
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8206092715263367
0 references
0.7802131175994873
0 references
0.7704057693481445
0 references
0.761523425579071
0 references
0.7553640007972717
0 references
