![]() In this paper we present a generalization of a constructive algorithm for the multi-dimensional bin packing. The unrestricted problem is known to be NP-hard. parallel straight cuts that can recursively cut the bin into pieces so that each piece contains a box and no box has been intersected by a cut. That is, there should exist a series of face. The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while satisfying the requirement that the packing should be guillotine cuttable. Multi-dimensional Bin Packing Problems with Guillotine Constraints For dual bin packing, no on-line algorithm is competitive. For the on-line variant, we define maximum resource variants of classical and dual bin packing. algorithms, First-Fit-Increasing and First-Fit-Decreasing for the maximum resource variant of classical bin packing. ![]() This paper presents results for the opposite problems, where we would like to maximize the number of bins used. Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |