A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
In this paper, our objective is to develop a mathematical formulation of solving the Bin Packing Problem (BPP) with different sizes of box. It has become one of the most important mathematical applications throughout the time. In our study, Modified Branch and Bound Algorithm (MBBA) is developed to generate all the feasible packing patterns of given boxes to required containers for One-Dimensional BPP. Further development of algorithms was made to ascertain the locations of each box within thedoi:10.1109/ipps.1991.153769 dblp:conf/ipps/BerkeyW91 fatcat:5gpb7sj3fvhyhcl5v3bbb6xycu