Valid Linear Programming Bounds for Exact Mixed-Integer Programming.
Daniel E. SteffyKati WolterPublished in: INFORMS J. Comput. (2013)
Keyphrases
- mixed integer programming
- linear programming
- column generation
- lagrangian relaxation
- linear program
- mixed integer
- valid inequalities
- feasible solution
- linear programming relaxation
- lower bound
- dynamic programming
- lower and upper bounds
- integer programming
- mathematical programming
- upper bound
- np hard
- production planning
- set partitioning
- optimal solution
- primal dual
- lot sizing
- cutting plane
- dantzig wolfe decomposition
- integer program
- worst case
- high dimensional
- branch and bound
- computationally expensive
- random variables
- lp relaxation
- objective function