An Efficient Lagrangian Relaxation for the Contact Map Overlap Problem.
Rumen AndonovNicola YanevNoël Malod-DogninPublished in: WABI (2008)
Keyphrases
- lagrangian relaxation
- contact map
- integer programming
- lower bound
- feasible solution
- branch and bound algorithm
- dual decomposition
- dynamic programming
- linear programming
- np hard
- column generation
- lower and upper bounds
- protein structure alignment
- lagrangian heuristic
- relaxation algorithm
- upper bound
- maximum clique
- mixed integer linear programs
- shortest path
- cutting plane algorithm
- scheduling problem