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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
