Improved Smoothed Analysis of Multiobjective Optimization.

Autor: BRUNSCH, TOBIAS¹ brunsch@cs.uni-bonn.de, HEIKO RÖGLIN¹ roeglin@cs.uni-bonn.de

Publikováno v: Journal of the ACM. Feb2015, Vol. 62 Issue 1, p1-58. 58p.

Smoothed Analysis of Pareto Curves in Multiobjective Optimization

Autor: Heiko Röglin

Publikováno v: Beyond the Worst-Case Analysis of Algorithms

In a multiobjective optimization problem a solution is called Pareto-optimal if no criterion can be improved without deteriorating at least one of the other criteria. Computing the set of all Pareto-optimal solutions is a common task in multiobjectiv

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::6156648c4add62b350abe3f6598b4bce
https://doi.org/10.1017/9781108637435.020

WITHDRAWN: Preface: 15th Cologne–Twente Workshop on graphs and combinatorial optimization (CTW 2017)

Autor: Bert Randerath, Rainer Schrader, Oliver Schaudt, Frank Vallentin, Heiko Röglin, Britta Peis

Publikováno v: Discrete Applied Mathematics.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::24c91fe74bdb6a551be2ac46736d4c4f
https://doi.org/10.1016/j.dam.2019.10.023

The Alternating Stock Size Problem and the Gasoline Puzzle

Autor: Alantha Newman, Heiko Röglin, Johanna Seif

Publikováno v: ACM Transactions on Algorithms
ACM Transactions on Algorithms, 2018, 14 (2), pp.1-23. ⟨10.1145/3178539⟩
European Symposium on algorithms
European Symposium on algorithms, Aug 2016, Aarhus, Denmark
ACM Transactions on Algorithms, Association for Computing Machinery, 2018, 14 (2), pp.1-23. ⟨10.1145/3178539⟩

Given a set S of integers whose sum is zero, consider the problem of finding a permutation of these integers such that (i) all prefix sums of the ordering are nonnegative and (ii) the maximum value of a prefix sum is minimized. Kellerer et al. call t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5daf039349176a3830deb5e46673cf75
https://hal.science/hal-01994671

Internet routing between autonomous systems: Fast algorithms for path trading

Autor: Ruben van der Zwaan, Heiko Röglin, André Berger

Publikováno v: Discrete Applied Mathematics, 185, 8-17. Elsevier

Routing traffic on the internet efficiently has become an important research topic over the past decade. In this article we consider a generalization of the shortest path problem, the path-trading problem, which has applications in inter-domain traff

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf6fbcaf92de7841f67780db81bb92ca
https://cris.maastrichtuniversity.nl/en/publications/c4bd80d2-6347-4214-8b14-b3757ca42e13