Abstract
We present two procedures for tightening cover induced inequalities in 0-1 programs by using knapsack constraints plus some other information from the program. The tightening is obtained by solving successive knapsack problems with all 0-1 objective function coefficients, and using dominance criteria to avoid the explicit solving of some knapsack problems. The new constraints are 0-1 equivalent to and LP tighter than the original ones. Both procedures have O (n log n) complexity, where n is the number of variables with nonzero coefficients in the knapsack constraint, however one of them can strongly reduce the computational effort. Some computational experience is reported.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.