5 citations · 7 across the 8 of their papers we have counts for
1 paper · 1 filter
Abbas Bazzi, Samuel Fiorini, Sangxia Huang +1
Initially developed for the min-knapsack problem, the knapsack cover inequalities are used in the current best relaxations for numerous combinatorial optimization problems of cover…