Compact optimization can outperform separation: a case study in structural proteomics

DOI10.1007/s10288-004-0036-8zbMath1061.65049OpenAlexW2088248957MaRDI QIDQ1762887

Giuseppe Lancia, Robert D. Carr

Publication date: 11 February 2005

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-004-0036-8

zbMATH Keywords

linear programmingnumerical examplescombinatorial optimizationtraveling salesman problemseparation algorithmcontact mapcompact optimizationprotein foldsstructural proteomicssubtour-elimination

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Linear programming (90C05) Combinatorial optimization (90C27) Protein sequences, DNA sequences (92D20)

Related Items (7)

Mathematical programming in computational biology: an annotated bibliography ⋮ Deriving compact extended formulations via LP-based separation techniques ⋮ Some operations research methods for analyzing protein sequences and structures ⋮ Deriving compact extended formulations via LP-based separation techniques ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ An effective compact formulation of the max cut problem on sparse graphs ⋮ A branch-and-cut algorithm for multiple sequence alignment

This page was built for publication: Compact optimization can outperform separation: a case study in structural proteomics