Solving the Protein Threading Problem by Lagrangian Relaxation.
Stefan BalevPublished in: WABI (2004)
Keyphrases
- lagrangian relaxation
- mixed integer program
- subgradient method
- integer programming
- protein structure prediction
- lower bound
- branch and bound algorithm
- feasible solution
- np hard
- lagrangian dual
- branch and bound search
- column generation
- linear programming
- dynamic programming
- lower and upper bounds
- dual decomposition
- capacity constraints
- network design problem
- relaxation algorithm
- lagrangian heuristic
- protein sequences
- mixed integer programming
- integer program
- branch and bound
- mixed integer linear programs
- combinatorial optimization
- protein structure
- single machine scheduling problem
- neural network
- approximation algorithms
- mathematical model
- valid inequalities
- shortest path