Year-end Sale % OFF 
Abstract
This note examines the likelihood of packing two identical one dimensional shelves of integer length L by items whose individual lengths are divisors of L, given that their combined length sums-up to 2L. We compute the number of packing failures and packing successes for integer shelve lengths L, 1 ≤ L ≤ 1000, by implementing a dynamic programming scheme using a problem specific "boundedness property". The computational results indicate that the likelihood of a packing failure is very rare. We observe that the existence of packing failures is tied to the number of divisors of L and prove that the number of divisors has to be at least 8 for a packing failure to exist.
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.
