A Lagrangian relaxation approach for the multiple sequence alignment problem.
Ernst AlthausStefan CanzarPublished in: J. Comb. Optim. (2008)
Keyphrases
- lagrangian relaxation
- integer programming
- feasible solution
- lower bound
- linear programming
- branch and bound algorithm
- column generation
- np hard
- dynamic programming
- lower and upper bounds
- relaxation algorithm
- capacity constraints
- dual decomposition
- mixed integer programming
- shortest path
- valid inequalities
- single machine scheduling problem
- network design problem
- subgradient method
- upper bound
- lagrangian heuristic
- mixed integer program
- data structure
- lagrangian dual
- optimal solution
- genetic algorithm