On the exact separation of mixed integer knapsack cuts.
Ricardo FukasawaMarcos GoycooleaPublished in: Math. Program. (2011)
Keyphrases
- mixed integer
- feasible solution
- cover inequalities
- linear program
- optimal solution
- knapsack problem
- continuous relaxation
- convex hull
- continuous variables
- benders decomposition
- mixed integer programming
- cutting plane
- linear programming
- lot sizing
- valid inequalities
- dynamic programming
- mixed integer program
- upper bound
- objective function
- tabu search
- multistage
- lagrangian heuristic
- np hard
- dynamic systems
- branch and bound
- evolutionary algorithm
- quadratic program
- search space
- lower bound
- search algorithm
- bayesian networks