Cutting plane versus compact formulations for uncertain (integer) linear programs.
Matteo FischettiMichele MonaciPublished in: Math. Program. Comput. (2012)
Keyphrases
- linear program
- cutting plane
- mixed integer linear programming
- mixed integer
- column generation
- integer program
- valid inequalities
- linear programming
- cutting plane algorithm
- extreme points
- optimal solution
- dynamic programming
- integer programming
- primal dual
- mixed integer programming
- simplex method
- integer linear programming
- knapsack problem
- linear programming problems
- objective function
- interior point methods
- lower bound
- lagrangian relaxation
- np hard
- learning algorithm
- lp relaxation
- branch and bound algorithm
- convex hull
- upper bound