Integrality gaps of linear and semi-definite programming relaxations for Knapsack
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Minimal Equivalent Binary Knapsack Inequalities
INFORMS Journal on Computing
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
Operations Research Letters
Hi-index | 0.04 |