On Lagrangian Relaxation of Quadratic Matrix Constraints.
Kurt M. AnstreicherHenry WolkowiczPublished in: SIAM J. Matrix Anal. Appl. (2000)
Keyphrases
- lagrangian relaxation
- lower and upper bounds
- mixed integer program
- capacity constraints
- integer programming
- lower bound
- column generation
- feasible solution
- valid inequalities
- np hard
- branch and bound algorithm
- lagrangian heuristic
- dynamic programming
- constraint programming
- dual decomposition
- mixed integer
- linear programming
- mixed integer programming
- upper bound
- semidefinite
- network design problem
- dual variables
- special case
- mixed integer linear programs
- linear programming problems
- objective function
- subgradient method