A heuristic algorithm based on Lagrangian relaxation for the closest string problem.
Shunji TanakaPublished in: Comput. Oper. Res. (2012)
Keyphrases
- lagrangian relaxation
- integer programming
- lower bound
- feasible solution
- branch and bound algorithm
- np hard
- lower and upper bounds
- column generation
- dynamic programming
- dual decomposition
- linear programming
- capacity constraints
- mixed integer programming
- mixed integer program
- network design problem
- tabu search
- optimal solution
- cutting plane algorithm
- relaxation algorithm
- shortest path
- upper bound
- single machine scheduling problem
- subgradient method
- branch and bound