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:	90C99 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/ae62ea4ea7da4507ae647b8dc97ff9ae
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:ae62ea4ea7da4507ae647b8dc97ff9ae
record_format	dspace
spelling	oai:doaj.org-article:ae62ea4ea7da4507ae647b8dc97ff9ae2021-12-02T05:01:07ZRobust combinatorial optimization under convex and discrete cost uncertainty2192-440610.1007/s13675-018-0103-0https://doaj.org/article/ae62ea4ea7da4507ae647b8dc97ff9ae2018-09-01T00:00:00Zhttp://www.sciencedirect.com/science/article/pii/S2192440621001015https://doaj.org/toc/2192-4406In 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, and with a special emphasis on the role of the chosen uncertainty sets. Moreover, we give an overview over exact solution methods for NP-hard cases. While mostly concentrating on the classical concept of strict robustness, we also cover more recent two-stage optimization paradigms.Christoph BuchheimJannis KurtzElsevierarticle90C99Applied mathematics. Quantitative methodsT57-57.97Electronic computers. Computer scienceQA75.5-76.95ENEURO Journal on Computational Optimization, Vol 6, Iss 3, Pp 211-238 (2018)
institution	DOAJ
collection	DOAJ
language	EN
topic	90C99 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
spellingShingle	90C99 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95 Christoph Buchheim Jannis Kurtz Robust combinatorial optimization under convex and discrete cost uncertainty
description	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, and with a special emphasis on the role of the chosen uncertainty sets. Moreover, we give an overview over exact solution methods for NP-hard cases. While mostly concentrating on the classical concept of strict robustness, we also cover more recent two-stage optimization paradigms.
format	article
author	Christoph Buchheim Jannis Kurtz
author_facet	Christoph Buchheim Jannis Kurtz
author_sort	Christoph Buchheim
title	Robust combinatorial optimization under convex and discrete cost uncertainty
title_short	Robust combinatorial optimization under convex and discrete cost uncertainty
title_full	Robust combinatorial optimization under convex and discrete cost uncertainty
title_fullStr	Robust combinatorial optimization under convex and discrete cost uncertainty
title_full_unstemmed	Robust combinatorial optimization under convex and discrete cost uncertainty
title_sort	robust combinatorial optimization under convex and discrete cost uncertainty
publisher	Elsevier
publishDate	2018
url	https://doaj.org/article/ae62ea4ea7da4507ae647b8dc97ff9ae
work_keys_str_mv	AT christophbuchheim robustcombinatorialoptimizationunderconvexanddiscretecostuncertainty AT janniskurtz robustcombinatorialoptimizationunderconvexanddiscretecostuncertainty
_version_	1718400847901097984

Robust combinatorial optimization under convex and discrete cost uncertainty

Ejemplares similares