Lagrangian Relaxation Techniques for Scalable Spatial Conservation Planning.
Akshat KumarXiaoJian WuShlomo ZilbersteinPublished in: AAAI (2012)
Keyphrases
- lagrangian relaxation
- integer programming
- lower bound
- branch and bound algorithm
- feasible solution
- lower and upper bounds
- dynamic programming
- np hard
- linear programming
- column generation
- dual decomposition
- mixed integer programming
- relaxation algorithm
- lagrangian heuristic
- capacity constraints
- production planning
- network design problem
- mixed integer program
- shortest path
- single machine scheduling problem
- heuristic search
- upper bound
- mixed integer linear programs
- graphical models
- objective function
- cost function
- energy minimization
- branch and bound