On the facets of the mixed-integer knapsack polyhedron.
Alper AtamtürkPublished in: Math. Program. (2003)
Keyphrases
- mixed integer
- convex hull
- feasible solution
- facet defining
- valid inequalities
- facet defining inequalities
- extreme points
- optimal solution
- knapsack problem
- linear program
- dynamic programming
- mixed integer programming
- benders decomposition
- cutting plane
- linear programming
- continuous relaxation
- network design problem
- mixed integer program
- tabu search
- objective function
- lot sizing
- packing problem
- lagrangian relaxation
- mathematical model
- upper bound
- optimization problems
- convex sets
- continuous variables
- column generation
- lagrangian heuristic