On bounded pitch inequalities for the min-knapsack polytope.
Yuri FaenzaIgor MalinovicMonaldo MastrolilliOla SvenssonPublished in: CoRR (2018)
Keyphrases
- facet defining inequalities
- knapsack problem
- facet defining
- subtour elimination
- dynamic programming
- valid inequalities
- mixed integer
- feasible solution
- convex hull
- optimal solution
- linear inequalities
- binary variables
- traveling salesman problem
- cover inequalities
- lattice points
- sufficient conditions
- stable set
- np hard
- linear programming
- packing problem
- optimization problems
- upper bound
- directed graph
- semidefinite
- lp relaxation
- greedy heuristic
- extreme points
- integer programming problems
- lower bound
- learning algorithm