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...
Guardado en:
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!
|
Ejemplares similares
-
Robust combinatorial optimization under budgeted–ellipsoidal uncertainty
por: Jannis Kurtz
Publicado: (2018) -
Portfolio optimization with pw-robustness
por: Virginie Gabrel, et al.
Publicado: (2018) -
PANDA: a software for polyhedral transformations
por: Stefan Lörwald, et al.
Publicado: (2015) -
A polyhedral approach to the generalized minimum labeling spanning tree problem
por: ThiagoGouveiada Silva, et al.
Publicado: (2019) -
Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers
por: Jens Poppenborg, et al.
Publicado: (2016)