On Bounded Pitch Inequalities for the Min-Knapsack Polytope.
Yuri FaenzaIgor MalinovicMonaldo MastrolilliOla SvenssonPublished in: ISCO (2018)
Keyphrases
- facet defining inequalities
- knapsack problem
- facet defining
- subtour elimination
- binary variables
- dynamic programming
- valid inequalities
- feasible solution
- linear inequalities
- mixed integer
- cover inequalities
- lattice points
- multiple choice
- greedy algorithm
- convex hull
- mixed integer linear programs
- upper bound
- lp relaxation
- stable set
- optimization problems
- optimal solution
- continuous functions
- acoustic features
- integer variables
- traveling salesman problem