SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY
Year of publication: |
2014
|
---|---|
Authors: | ENGAU, ALEXANDER |
Published in: |
Asia-Pacific Journal of Operational Research (APJOR). - World Scientific Publishing Co. Pte. Ltd., ISSN 1793-7019. - Vol. 31.2014, 04, p. 1450022-1
|
Publisher: |
World Scientific Publishing Co. Pte. Ltd. |
Subject: | Combinatorial optimization | integer programming | binary quadratic programming | semidefinite programming | doubly non-negative relaxation | computational biology | protein folding | protein similarity | rotamer assignment | contact map overlap |
-
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
Galli, Laura, (2021)
-
Construction and improvement algorithms for dispersion problems
Aringhieri, Roberto, (2015)
-
A dual bounding framework through cost splitting for binary quadratic optimization
Bayani, Mahdis, (2024)
- More ...
-
Tradeoff-based decomposition and decision-making in multiobjective programming
Engau, Alexander, (2009)
-
Engau, Alexander, (2013)
-
Engau, Alexander, (2013)
- More ...