A Lagrangian Relaxation for the Maximum Stable Set Problem
Manoel B. CampêloRicardo C. CorrêaPublished in: CoRR (2009)
Keyphrases
- lagrangian relaxation
- integer programming
- lower bound
- column generation
- feasible solution
- linear programming
- lower and upper bounds
- dynamic programming
- branch and bound algorithm
- np hard
- dual decomposition
- relaxation algorithm
- capacity constraints
- lagrangian heuristic
- network design problem
- upper bound
- mixed integer programming
- mixed integer program
- mixed integer linear programs
- shortest path
- single machine scheduling problem
- cutting plane algorithm
- optimal solution
- evolutionary algorithm
- machine learning
- subgradient method
- lagrangian dual
- data structure
- set covering problem
- branch and bound
- valid inequalities
- linear program