Optimum feature selection by zero-one integer programming

An optimal method for finding a minimum feature subset based on box classifiers is described. Feature selection is represented as a problem of zero-one integer programming. Then an implicit enumeration method is developed in order to solve this problem. Numerical examples are presented to illustrate the effectiveness of this approach.