Abstract
The bin packing problem is a well known NP-hard problem that consists in placing a set of items of different sizes in a mimimum number of bins. An iterative algorithm for the one-dimensional offline bin packing problem is presented whose number of iterations needed to reach an unchanging partition when faced to a particular instance is bounded by the performance of the point Jacobi method on the problem taken as a matrix relaxation one. The algorithm was tested on a large widely used benchmark instances from the literature and behaved very successfully on a class considered as very difficult.
Sign-in/Register to access full text options 
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.
