Cutting planes from extended LP formulations.
Merve BodurSanjeeb DashOktay GünlükPublished in: Math. Program. (2017)
Keyphrases
- cutting plane
- valid inequalities
- mixed integer linear programming
- linear programming
- mixed integer
- integer programming problems
- cutting plane algorithm
- integer programming
- column generation
- integer program
- lower bound
- linear programming relaxation
- traveling salesman problem
- lower and upper bounds
- lp relaxation
- linear program
- mixed integer program
- knapsack problem
- optimal solution
- mixed integer programming
- primal dual
- np hard
- feasible solution
- mathematical programming
- quadratic programming
- continuous variables
- lagrangian relaxation
- stochastic programming
- particle swarm optimization algorithm
- state space
- evolutionary algorithm
- dantzig wolfe decomposition