Login / Signup
Lifting the knapsack cover inequalities for the knapsack polytope.
Adam N. Letchford
Georgia Souli
Published in:
Oper. Res. Lett. (2020)
Keyphrases
</>
cover inequalities
convex hull
knapsack problem
linear program
facet defining inequalities
continuous variables
dynamic programming
optimal solution
mixed integer
np hard
linear programming
column generation
special case
probabilistic model