Oliver Bodemer
IBM J. Res. Dev
We show how clique and cover induced inequalities implied from 0-1 knapsack constraints can be obtained as Chvatal-Gomory inequalities. LP tighter and 0-1 equivalent constraints to 0-1 knapsack constraints obtained by the 'big M' reduction procedure can also be generated as Chvatal-Gomory inequalities. We also show how some extended coefficient reduction based LP tighter and 0-1 equivalent constraints can be generated as Gomory fractional cuts. © 1994.
Oliver Bodemer
IBM J. Res. Dev
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM