Quadratic binary programming models in computational biology
From MaRDI portal
Recommendations
- Integer quadratic programming models in computational biology
- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
- Computational molecular biology
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
Cited in
(13)- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- Computational molecular biology
- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- Comparing integer linear programming to SAT-solving for hard problems in computational and systems biology
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
- Applications and computational advances for solving the QUBO model
- scientific article; zbMATH DE number 5149006 (Why is no real title available?)
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design
- Integer quadratic programming models in computational biology
- Global optimality conditions and optimization methods for quadratic integer programming problems
- Mathematical programming in computational biology: an annotated bibliography
This page was built for publication: Quadratic binary programming models in computational biology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867346)
