A heuristic algorithm based on Lagrangian relaxation for the closest string problem.
Shunji TanakaPublished in: SMC (2010)
Keyphrases
- lagrangian relaxation
- integer programming
- lower bound
- dynamic programming
- branch and bound algorithm
- feasible solution
- column generation
- linear programming
- np hard
- lower and upper bounds
- capacity constraints
- network design problem
- dual decomposition
- relaxation algorithm
- mixed integer program
- mixed integer programming
- valid inequalities
- single machine scheduling problem
- subgradient method
- computational complexity
- constraint programming
- optimal solution
- shortest path
- np complete
- optimization problems
- upper bound
- scheduling problem
- lagrangian heuristic