Abstract
We define a partition of the unit hypercube into polytopes. These polytopes correspond to arrangements of a sequence of objects into bins in the next fit solution to the one-dimensional bin packing problem. The probability that an arrangement appears is given by the volume of the corresponding polytope in the partition. We show that this volume can be calculated as the solution to a problem of permutation enumeration and apply this technique to analyze the behavior of the next fit algorithm.
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.
