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 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 vec...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Elsevier
2018
|
| Subjects: | |
| Online Access: | https://doaj.org/article/00b633709f694b8d960c4cc77e9ef442 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|