Abstract
This paper develops a simple, dual-based, and monotonic bounding procedure for solving integer linear programs. Although it is dual-based, it can be usefully applied for integer programs for which the LP relaxatyion yields good bounds but cannot be solved easily by direct methods. Preliminary results of the application of the procedure on a class of real-world problems are promising.
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.
