Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets.
Sujeevraja SanjeeviSina MasihabadiKiavash KianfarPublished in: Math. Program. (2016)
Keyphrases
- mixed integer
- feasible solution
- convex hull
- totally unimodular
- linear program
- lot sizing
- benders decomposition
- optimal solution
- mixed integer programming
- cutting plane
- continuous relaxation
- linear programming
- mixed integer program
- lagrangian heuristic
- valid inequalities
- continuous variables
- convex sets
- knapsack problem
- dynamic programming