Abstract
We present an exact separation scheme for identifying most violated extended cover inequalities for application to multidimensional knapsack problems ( MKP). The minimality of the resulting covers is shown to be a basic property of the criterion used for separation, namely the ratio between left- and right-hand sides of the extended cover inequality looked for. Computational results obtained on a set of randomly generated ( MKP) instances together with instances from the OR-library with up to 180 variables and 60 constraints show significant reduction in overall computing times as compared with the standard version of Cplex 6.5 in MIP mode using automatic cover inequality generation.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
