Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology

Engau, Alexander (2014) Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology. Asia-Pacific Journal of Operational Research, 31 (4). ISSN 0217-5959

Full text not available from this repository.

Abstract

We present two recent integer programming models in molecular biology and study practical reformulations to compute solutions to some of these problems. In extension of previously tested linearization techniques, we formulate corresponding semidefinite relaxations and discuss practical rounding strategies to find good feasible approximate solutions. Our computational results highlight the possible advantages and remaining challenges of this approach especially on large-scale problems.

Item Type:
Journal Article
Journal or Publication Title:
Asia-Pacific Journal of Operational Research
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1800/1803
Subjects:
ID Code:
90196
Deposited By:
Deposited On:
08 Feb 2018 15:02
Refereed?:
Yes
Published?:
Published
Last Modified:
01 Jan 2020 11:11