On Minimal Valid Inequalities for Mixed Integer Conic Programs.
Fatma Kilinç-KarzanPublished in: Math. Oper. Res. (2016)
Keyphrases
- mixed integer
- valid inequalities
- mixed integer programming
- linear program
- cutting plane
- cutting plane algorithm
- lot sizing
- optimal solution
- feasible solution
- network design problem
- convex hull
- continuous relaxation
- continuous variables
- mixed integer program
- network flow problem
- linear programming
- facet defining inequalities
- objective function
- scheduling problem
- lower and upper bounds
- branch and bound
- traveling salesman problem
- mathematical model
- tabu search
- lp relaxation
- search algorithm