Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes.
Todd EastonKevin HookerPublished in: Discret. Optim. (2008)
Keyphrases
- cover inequalities
- binary variables
- convex hull
- continuous variables
- linear program
- valid inequalities
- knapsack problem
- random variables
- mixed integer programming
- convex sets
- linear constraints
- linear programming
- energy function
- limited memory
- problems in computer vision
- piecewise linear
- linear programming relaxation
- integer programming
- mixed integer
- traveling salesman problem
- np hard
- convex functions
- training samples
- production planning
- computer vision
- combinatorial optimization
- probability distribution
- special case
- optimal solution
- objective function