On inequalities with bounded coefficients and pitch for the min knapsack polytope.
Daniel BienstockYuri FaenzaIgor MalinovicMonaldo MastrolilliOla SvenssonMark ZuckerbergPublished in: Discret. Optim. (2022)
Keyphrases
- facet defining inequalities
- knapsack problem
- facet defining
- subtour elimination
- valid inequalities
- feasible solution
- convex hull
- dynamic programming
- linear combination
- lattice points
- wavelet coefficients
- optimal solution
- cover inequalities
- mixed integer
- stable set
- basis functions
- linear inequalities
- traveling salesman problem
- sufficient conditions
- multiresolution
- neural network
- binary variables
- upper bound
- greedy algorithm
- linear program
- cutting plane
- extreme points
- planar graphs
- simulated annealing