On the Exact Separation of Mixed Integer Knapsack Cuts.
Ricardo FukasawaMarcos GoycooleaPublished in: IPCO (2007)
Keyphrases
- mixed integer
- feasible solution
- optimal solution
- cover inequalities
- linear program
- convex hull
- mixed integer programming
- continuous variables
- benders decomposition
- linear programming
- lot sizing
- cutting plane
- tabu search
- knapsack problem
- dynamic programming
- continuous relaxation
- objective function
- network design problem
- upper bound
- mixed integer program
- valid inequalities
- exact solution
- lagrangian heuristic
- packing problem
- column generation
- np hard
- lower bound
- quadratic program
- routing problem
- totally unimodular