A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem.
Ernst AlthausStefan CanzarPublished in: COCOA (2007)
Keyphrases
- lagrangian relaxation
- integer programming
- lower bound
- dynamic programming
- column generation
- feasible solution
- linear programming
- lower and upper bounds
- branch and bound algorithm
- np hard
- mixed integer programming
- dual decomposition
- mixed integer program
- shortest path
- capacity constraints
- subgradient method
- relaxation algorithm
- cutting plane algorithm
- lagrangian heuristic
- lagrangian dual
- network design problem
- valid inequalities
- learning algorithm
- scheduling problem
- branch and bound