Journal
OPERATIONS RESEARCH LETTERS
Volume 32, Issue 1, Pages 5-14Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/S0167-6377(03)00057-9
Keywords
two-dimensional knapsack; upper bound; approximation algorithm; worst-case performance; exact algorithm
Categories
Ask authors/readers for more resources
We address the two-dimensional Knapsack Problem (2YP), aimed at packing a maximum-profit subset of rectangles selected from a given set into another rectangle. We consider the natural relaxation of 2KP given by the one-dimensional KP with item weights equal to the rectangle areas, proving the worst-case performance of the associated upper bound, and present and compare computationally four exact algorithms based on the above relaxation, showing their effectiveness. (C) 2003 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available