Robust balanced optimization
An instance of a balanced optimization problem with vector costs consists of a ground set X, a cost-vector for every element of brendan phaser X, and a system of feasible subsets over X.The goal is to find a feasible subset that minimizes the so-called imbalance of values in every coordinate of the underlying vector costs.Balanced optimization prob