News
Bin packing problems are a class of NP-hard combinatorial optimisation challenges with wide-ranging applications in logistics, manufacturing, cloud computing and scheduling.
J. Levine, F. Ducatelle, Ant Colony Optimization and Local Search for Bin Packing and Cutting Stock Problems, The Journal of the Operational Research Society, Vol. 55, No. 7, Part Special Issue: Local ...
Given a set of rectangular pieces to be cut from an unlimited number of standardized stock pieces (bins), the Two-Dimensional Finite Bin Packing Problem is to determine the minimum number of stock ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback