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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: AnnetteM.C. Ficker, FritsC.R. Spieksma, GerhardJ. Woeginger
Formato: article
Lenguaje:EN
Publicado: Elsevier 2018
Materias:
Acceso en línea:https://doaj.org/article/00b633709f694b8d960c4cc77e9ef442
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!