//-->
Cutting place algorithms for 1-0 programming based on cardinality cuts
Oguz, Osman, (2010)
Bounds on the Opportunity Cost of Neglecting Reoptimization
Oguz, Osman, (2000)
A fully polynomial approximation algorithm for the 0-1 knapsack problem
Magazine, M. J., (1981)