Lower bounds for two-period grooming via linear programming duality.
Charles J. ColbournGaetano QuattrocchiViolet R. SyrotiukPublished in: Networks (2008)
Keyphrases
- linear programming
- lower bound
- np hard
- objective function
- linear programming relaxation
- optimal solution
- upper bound
- linear program
- branch and bound algorithm
- lagrangian relaxation
- feasible solution
- branch and bound
- integer programming
- mathematical programming
- column generation
- primal dual
- lower bounding
- linear programming problems
- dynamic programming
- max sat
- vc dimension
- lower and upper bounds
- upper and lower bounds
- quadratic programming
- cutting plane
- approximation algorithms
- nonlinear programming
- scheduling problem
- network flow
- image registration
- worst case
- reinforcement learning
- interior point
- quadratic assignment problem
- main memory
- randomly generated problems