Robust combinatorial optimization under convex and discrete cost uncertainty
In this survey, we discuss the state of the art of robust combinatorial optimization under uncertain cost functions. We summarize complexity results presented in the literature for various underlying problems, with the aim of pointing out the connections between the different results and approaches,...
Guardado en:
Autores principales: | Christoph Buchheim, Jannis Kurtz |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2018
|
Materias: | |
Acceso en línea: | https://doaj.org/article/ae62ea4ea7da4507ae647b8dc97ff9ae |
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) -
Special issue on: robust combinatorial optimization
por: Arie M.C.A. Koster, et al.
Publicado: (2018) -
Portfolio optimization with pw-robustness
por: Virginie Gabrel, et al.
Publicado: (2018) -
Robust bilateral trade with discrete types
por: Kamyar Kargar, et al.
Publicado: (2018) -
Special issue on: Nonlinear and combinatorial methods for energy optimization
por: Claudia D’Ambrosio, et al.
Publicado: (2017)