Cutting planes for mixed-integer knapsack polyhedra.
Xiao-Qing YanE. Andrew BoydPublished in: Math. Program. (1998)
Keyphrases
- mixed integer
- cutting plane
- feasible solution
- extreme points
- convex hull
- optimal solution
- knapsack problem
- linear programming
- cutting plane algorithm
- mixed integer linear programming
- linear program
- integer programming problems
- tabu search
- mixed integer programming
- dynamic programming
- mixed integer program
- valid inequalities
- objective function
- mathematical model
- convex sets
- lagrangian relaxation
- metaheuristic
- integer programming
- lot sizing
- special case
- upper bound
- search algorithm
- continuous variables
- column generation
- probabilistic model
- branch and bound
- evolutionary algorithm
- graphical models
- high dimensional
- lower bound
- generative model