Improving spectral bounds for clustering problems by Lagrangian relaxation.
Mohammad DolatabadiAndrea LodiZahra AfsharnejadPublished in: Int. Trans. Oper. Res. (2011)
Keyphrases
- lagrangian relaxation
- lower bound
- lower and upper bounds
- dynamic programming
- combinatorial optimization
- integer programming
- branch and bound algorithm
- randomly generated test problems
- subgradient method
- mixed integer linear programs
- column generation
- linear programming
- optimization problems
- computational complexity
- particle swarm optimization
- cutting plane
- worst case
- upper bound
- data points
- lagrangian heuristic