Abstract: The online 3D bin packing problem (O3D-BPP) is a very difficult and challenging combinatorial optimization problem. In the classic O3D-BPP problem, the agent only knows the information of ...
Abstract: In this paper we investigate the application of memetic algorithm (MA) to the k-set packing problem, a well-known $N$ P-hard problem with applications in ...
A production-ready solution for the Kaggle Christmas Tree Packing Challenge 2025. Pack 1-200 Christmas tree toys into the smallest possible square bounding box to minimize Σ(s²/n). ├── src/ # Source ...
The final, formatted version of the article will be published soon. Abstract: This paper introduces and studies the One-Dimensional Bin Packing Problem with Time Windows (1DBPP-TW)—a variant of the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results