Replication Data for: Mathematical programming algorithms for convex hull approximation with a hyperplane budget

This dataset contains instances for the problem of approximating a convex hull with an hyperplane budget given points from two classes, positive and negative. Two sub-datesets composed of 300 instances each are given, for which the minimum separation budget of the instances is known and unknown respectively. More details in the file README.txt.