Abstract
The 0-1 knapsack polyhedron as the most basic relaxation of a 0-1 integer program has attracted attention of many researchers over the years.We present a very fast method that is guaranteed to generate one facet for the 0-1 knapsack polyhedron. Unlike lifting of cover inequlities, our method does not require an initial minimal cover or a predetermined lifting sequencing, and its worst-case complexity is linear in number of variables. Therefore, it is suitable for incorporation into mixed interger programming(MIP) solvers, in order to generate, with negligible computational burden, one strong cut based on any 0-1 knapsack relaxation of a general MIP.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
