Lagrangian relaxation and pegging test for the clique partitioning problem.
Noriyoshi SukegawaYoshitsugu YamamotoLiyuan ZhangPublished in: Adv. Data Anal. Classif. (2013)
Keyphrases
- lagrangian relaxation
- branch and bound algorithm
- lower bound
- integer programming
- branch and bound
- np hard
- linear programming
- lagrangian heuristic
- column generation
- dynamic programming
- feasible solution
- optimal solution
- upper bound
- mixed integer programming
- single machine scheduling problem
- mixed integer program
- capacity constraints
- dual decomposition
- relaxation algorithm
- combinatorial optimization
- lower and upper bounds
- subgradient method
- cutting plane algorithm
- mixed integer linear programs
- shortest path
- particle swarm optimization