Heuristics for online three-dimensional packing problems and algorithm selection framework for semi-online with full look-ahead

S Ali, AG Ramos, MA Carravilla, JF Oliveira - Applied Soft Computing, 2024 - Elsevier
In online three-dimensional packing problems (3D-PPs), unlike offline problems, items arrive
sequentially and require immediate packing decisions without any information about the …

CInf-FS: an efficient infinite feature selection method using K-means clustering to partition large feature spaces

SF Hassani Ziabari, S Eskandari, M Salahi - Pattern Analysis and …, 2023 - Springer
In this paper, we present a new feature selection algorithm for supervised problems. We
build our algorithm upon recently proposed infinite feature selection (Inf-FS) method where …