An interior point cutting plane heuristic for mixed integer programming.
Joe Naoum-SawayaSamir ElhedhliPublished in: Comput. Oper. Res. (2011)
Keyphrases
- mixed integer programming
- cutting plane
- interior point
- column generation
- linear programming
- mixed integer
- linear program
- linear programming problems
- interior point methods
- lagrangian relaxation
- valid inequalities
- integer program
- optimal solution
- integer programming
- primal dual
- feasible solution
- semidefinite programming
- branch and bound
- lot sizing
- convex hull
- dynamic programming
- np hard
- constraint programming
- objective function
- convex optimization
- markov random field
- network flow
- quadratic programming
- genetic algorithm
- branch and bound algorithm
- sufficient conditions
- evolutionary algorithm
- lower bound
- training data