A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems.
Oliver G. CzibulaHanyu GuYakov ZinderPublished in: WALCOM (2016)
Keyphrases
- lagrangian relaxation
- mixed integer program
- randomly generated test problems
- graph partitioning
- feasible solution
- lagrangian dual
- mixed integer programming
- scheduling problem
- lower bound
- integer programming
- linear programming
- dynamic programming
- column generation
- branch and bound algorithm
- lower and upper bounds
- graph model
- integer program
- optimal solution
- computer vision
- optimization problems
- search algorithm
- pairwise
- clustering algorithm
- cutting plane
- tabu search
- simulated annealing
- np hard