A Java-based simulation of the Bin Packing Problem, using an airplane-cargo scenario where cargo items (e.g., luggage) are packed into airplanes (bins) using two classic algorithms: First Fit (FF) and ...
The BPPLIB is a collection of codes, benchmarks, and links for the one-dimensional Bin Packing and Cutting Stock problem. If you need to refer to material taken from this library, please cite M.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results