Integral simplex using decomposition with primal cutting planes.
Samuel RosatIssmail ElhallaouiFrançois SoumisAndrea LodiPublished in: Math. Program. (2017)
Keyphrases
- cutting plane
- linear programming
- simplex algorithm
- cutting plane algorithm
- lagrangian dual
- integer programming problems
- linear program
- column generation
- integer programming
- integer program
- mixed integer
- simplex method
- primal dual
- valid inequalities
- lower bound
- knapsack problem
- objective function
- optimal solution
- feasible solution
- decomposition methods
- np hard
- lagrangian relaxation
- linear programming relaxation
- quadratic programming
- mixed integer programming
- graphical models
- dynamic programming
- dantzig wolfe decomposition
- network flow
- mathematical programming
- dynamic systems
- upper bound
- support vector