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

Descripción completa

Guardado en:
Detalles Bibliográficos
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