-Fan Decomposition and Tight Lagrangian Relaxation.
Jörg H. KappesStefan SchmidtChristoph SchnörrPublished in: ECCV (3) (2010)
Keyphrases
- lagrangian relaxation
- lower bound
- lagrangian dual
- branch and bound algorithm
- integer programming
- upper bound
- lower and upper bounds
- feasible solution
- np hard
- column generation
- dynamic programming
- linear programming
- capacity constraints
- dual decomposition
- mixed integer programming
- relaxation algorithm
- branch and bound
- worst case
- objective function
- lagrangian heuristic
- mixed integer program
- optimal solution
- decomposition algorithm
- network design problem
- single machine scheduling problem
- cutting plane algorithm
- decomposition method
- subgradient method
- cutting plane
- search space
- high dimensional
- mixed integer linear programs