Abstract: 3D container loading problem (3D-CLP) is a classic NP-hard optimization problem. Although computer scientists and discrete mathematicians have studied this problem for decades, there are ...
Abstract: A three-dimensional single container loading problem (3D-CLP) is aimed to load kinds of rectangular boxes into a single container with maximal volume utilization. This paper presents a multi ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results