Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics
Where are the hard knapsack problems?
Computers and Operations Research
The quadratic knapsack problem-a survey
Discrete Applied Mathematics
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Lot-Sizing with Stock Upper Bounds and Fixed Charges
SIAM Journal on Discrete Mathematics
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
An O(nlog n) procedure for identifying facets of the knapsack polytope
Operations Research Letters
Hi-index | 0.00 |