Browsing by Subject "1983 Dissertation K96"
Now showing items 1-1 of 1
-
(Texas A&M University. Libraries, 1983)We consider a bin-packing problem where the sizes of the bins are allowed to vary and where the goal is to maximize the number of pieces packed. This problem is NP-Hard. We examine a new efficient approximation algorithm ...