Abstract
In the present paper we derive an O( n 2 log n) algorithm for the linear programming (LP) relaxation of the two dimensional knapsack problem with box and generalized upper bound (GUB) constraints. The two dimensional linear knapsack problem with box constraints and GUB's generalizes the multiple choice linear knapsack problem considered by Dyer and others. The problem arose in an application in a steel tube rolling mill in India.
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.
