Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies.
Agha Iqbal AliShirley ShmerlingPublished in: Oper. Res. Lett. (1996)
Keyphrases
- lagrangian relaxation
- mixed integer linear programs
- valid inequalities
- integer programming
- cutting plane algorithm
- branch and bound algorithm
- feasible solution
- lower bound
- lower and upper bounds
- linear programming
- np hard
- column generation
- dynamic programming
- network design problem
- capacity constraints
- mixed integer programming
- dual decomposition
- lagrangian heuristic
- relaxation algorithm
- branch and bound
- mixed integer program
- subgradient method
- shortest path
- branch and bound search
- integer variables
- mixed integer
- image segmentation
- combinatorial optimization
- mathematical model
- optimal solution