By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for ...

High dimensionality often challenges the efficiency and accuracy of a classifier, while evolutionary feature selection is an effective method for data preprocessing and dimensionality reduction.