A Lagrangian relaxation approach to the edge-weighted clique problem.
Marcel HuntingUlrich FaigleWalter KernPublished in: Eur. J. Oper. Res. (2001)
Keyphrases
- lagrangian relaxation
- weighted graph
- maximum weight
- integer programming
- np hard
- feasible solution
- lower bound
- branch and bound algorithm
- column generation
- shortest path
- linear programming
- dynamic programming
- lower and upper bounds
- dual decomposition
- capacity constraints
- relaxation algorithm
- lagrangian heuristic
- mixed integer program
- subgradient method
- single machine scheduling problem
- network design problem
- cost function
- scheduling problem
- mixed integer linear programs