---
_id: '49487'
author:
- first_name: Natalia
full_name: Malancu, Natalia
last_name: Malancu
- first_name: Alexandra
full_name: Florea, Alexandra
id: '98958'
last_name: Florea
orcid: 0000-0003-0626-945X
citation:
ama: 'Malancu N, Florea A. Chapter 5: Quantitative methodological approaches to
citizenship and migration. In: Giugni M, Grasso M, eds. Handbook of Citizenship
and Migration. ; 2021. doi:https://doi.org/10.4337/9781789903133.00011'
apa: 'Malancu, N., & Florea, A. (2021). Chapter 5: Quantitative methodological
approaches to citizenship and migration. In M. Giugni & M. Grasso (Eds.),
Handbook of Citizenship and Migration. https://doi.org/10.4337/9781789903133.00011'
bibtex: '@inbook{Malancu_Florea_2021, title={Chapter 5: Quantitative methodological
approaches to citizenship and migration}, DOI={https://doi.org/10.4337/9781789903133.00011},
booktitle={Handbook of Citizenship and Migration}, author={Malancu, Natalia and
Florea, Alexandra}, editor={Giugni, Marco and Grasso, Maria}, year={2021} }'
chicago: 'Malancu, Natalia, and Alexandra Florea. “Chapter 5: Quantitative Methodological
Approaches to Citizenship and Migration.” In Handbook of Citizenship and Migration,
edited by Marco Giugni and Maria Grasso, 2021. https://doi.org/10.4337/9781789903133.00011.'
ieee: 'N. Malancu and A. Florea, “Chapter 5: Quantitative methodological approaches
to citizenship and migration,” in Handbook of Citizenship and Migration,
M. Giugni and M. Grasso, Eds. 2021.'
mla: 'Malancu, Natalia, and Alexandra Florea. “Chapter 5: Quantitative Methodological
Approaches to Citizenship and Migration.” Handbook of Citizenship and Migration,
edited by Marco Giugni and Maria Grasso, 2021, doi:https://doi.org/10.4337/9781789903133.00011.'
short: 'N. Malancu, A. Florea, in: M. Giugni, M. Grasso (Eds.), Handbook of Citizenship
and Migration, 2021.'
date_created: 2023-12-05T13:28:19Z
date_updated: 2023-12-05T13:38:08Z
department:
- _id: '603'
doi: https://doi.org/10.4337/9781789903133.00011
editor:
- first_name: Marco
full_name: Giugni, Marco
last_name: Giugni
- first_name: Maria
full_name: Grasso, Maria
last_name: Grasso
extern: '1'
language:
- iso: eng
publication: Handbook of Citizenship and Migration
publication_identifier:
unknown:
- 978 1 78990 312 6
status: public
title: 'Chapter 5: Quantitative methodological approaches to citizenship and migration'
type: book_chapter
user_id: '98958'
year: '2021'
...
---
_id: '47098'
author:
- first_name: Marius
full_name: Alt, Marius
last_name: Alt
- first_name: Carlo
full_name: Gallier, Carlo
last_name: Gallier
- first_name: Bodo
full_name: Sturm, Bodo
last_name: Sturm
- first_name: Martin
full_name: Kesternich, Martin
id: '98922'
last_name: Kesternich
citation:
ama: Alt M, Gallier C, Sturm B, Kesternich M. Ausblick Auf Die COP26 in Glasgow,
Eine Schrittweise Erhöhung Der Klimaschutzbeiträge Reicht Nicht – Ein Klimaklub
Sollte Mitgedacht Werden. ZEW Policy Brief 21-09; 2021.
apa: Alt, M., Gallier, C., Sturm, B., & Kesternich, M. (2021). Ausblick auf
die COP26 in Glasgow, Eine schrittweise Erhöhung der Klimaschutzbeiträge reicht
nicht – ein Klimaklub sollte mitgedacht werden. ZEW Policy Brief 21-09.
bibtex: '@book{Alt_Gallier_Sturm_Kesternich_2021, title={Ausblick auf die COP26
in Glasgow, Eine schrittweise Erhöhung der Klimaschutzbeiträge reicht nicht –
ein Klimaklub sollte mitgedacht werden}, publisher={ZEW Policy Brief 21-09}, author={Alt,
Marius and Gallier, Carlo and Sturm, Bodo and Kesternich, Martin}, year={2021}
}'
chicago: Alt, Marius, Carlo Gallier, Bodo Sturm, and Martin Kesternich. Ausblick
Auf Die COP26 in Glasgow, Eine Schrittweise Erhöhung Der Klimaschutzbeiträge Reicht
Nicht – Ein Klimaklub Sollte Mitgedacht Werden. ZEW Policy Brief 21-09, 2021.
ieee: M. Alt, C. Gallier, B. Sturm, and M. Kesternich, Ausblick auf die COP26
in Glasgow, Eine schrittweise Erhöhung der Klimaschutzbeiträge reicht nicht –
ein Klimaklub sollte mitgedacht werden. ZEW Policy Brief 21-09, 2021.
mla: Alt, Marius, et al. Ausblick Auf Die COP26 in Glasgow, Eine Schrittweise
Erhöhung Der Klimaschutzbeiträge Reicht Nicht – Ein Klimaklub Sollte Mitgedacht
Werden. ZEW Policy Brief 21-09, 2021.
short: M. Alt, C. Gallier, B. Sturm, M. Kesternich, Ausblick Auf Die COP26 in Glasgow,
Eine Schrittweise Erhöhung Der Klimaschutzbeiträge Reicht Nicht – Ein Klimaklub
Sollte Mitgedacht Werden, ZEW Policy Brief 21-09, 2021.
date_created: 2023-09-16T12:04:27Z
date_updated: 2023-12-06T18:27:32Z
language:
- iso: eng
publisher: ZEW Policy Brief 21-09
status: public
title: Ausblick auf die COP26 in Glasgow, Eine schrittweise Erhöhung der Klimaschutzbeiträge
reicht nicht – ein Klimaklub sollte mitgedacht werden
type: working_paper
user_id: '98922'
year: '2021'
...
---
_id: '47100'
author:
- first_name: Marc
full_name: Frick, Marc
last_name: Frick
- first_name: Annabell
full_name: Conzelmann, Annabell
last_name: Conzelmann
- first_name: Kathrine
full_name: von Graevenitz, Kathrine
last_name: von Graevenitz
- first_name: Martin
full_name: Kesternich, Martin
id: '98922'
last_name: Kesternich
- first_name: Ulrich
full_name: Wagner, Ulrich
last_name: Wagner
- first_name: Sebastian
full_name: Rausch, Sebastian
last_name: Rausch
citation:
ama: Frick M, Conzelmann A, von Graevenitz K, Kesternich M, Wagner U, Rausch S.
Transparente Klimabilanzen - Information Für Klimafreundliches Handeln.;
2021.
apa: Frick, M., Conzelmann, A., von Graevenitz, K., Kesternich, M., Wagner, U.,
& Rausch, S. (2021). Transparente Klimabilanzen - Information für klimafreundliches
Handeln.
bibtex: '@book{Frick_Conzelmann_von Graevenitz_Kesternich_Wagner_Rausch_2021, title={Transparente
Klimabilanzen - Information für klimafreundliches Handeln}, author={Frick, Marc
and Conzelmann, Annabell and von Graevenitz, Kathrine and Kesternich, Martin and
Wagner, Ulrich and Rausch, Sebastian}, year={2021} }'
chicago: Frick, Marc, Annabell Conzelmann, Kathrine von Graevenitz, Martin Kesternich,
Ulrich Wagner, and Sebastian Rausch. Transparente Klimabilanzen - Information
Für Klimafreundliches Handeln, 2021.
ieee: M. Frick, A. Conzelmann, K. von Graevenitz, M. Kesternich, U. Wagner, and
S. Rausch, Transparente Klimabilanzen - Information für klimafreundliches Handeln.
2021.
mla: Frick, Marc, et al. Transparente Klimabilanzen - Information Für Klimafreundliches
Handeln. 2021.
short: M. Frick, A. Conzelmann, K. von Graevenitz, M. Kesternich, U. Wagner, S.
Rausch, Transparente Klimabilanzen - Information Für Klimafreundliches Handeln,
2021.
date_created: 2023-09-16T12:09:05Z
date_updated: 2023-12-06T18:29:10Z
language:
- iso: eng
status: public
title: Transparente Klimabilanzen - Information für klimafreundliches Handeln
type: working_paper
user_id: '98922'
year: '2021'
...
---
_id: '49530'
author:
- first_name: Raphaela
full_name: Meyer zu Hörste-Bührer, Raphaela
id: '102100'
last_name: Meyer zu Hörste-Bührer
citation:
ama: Meyer zu Hörste-Bührer R. Barth for Future? Eine Barth-Relektüre vor dem Hintergrund
der Bewegung „Fridays for Future“. Römerbrief und Tageszeitung! Politik in
der Theologie Karl Barths. Published online 2021:133-154.
apa: Meyer zu Hörste-Bührer, R. (2021). Barth for Future? Eine Barth-Relektüre vor
dem Hintergrund der Bewegung „Fridays for Future“. Römerbrief Und Tageszeitung!
Politik in Der Theologie Karl Barths., 133–154.
bibtex: '@article{Meyer zu Hörste-Bührer_2021, title={Barth for Future? Eine Barth-Relektüre
vor dem Hintergrund der Bewegung „Fridays for Future“.}, journal={Römerbrief und
Tageszeitung! Politik in der Theologie Karl Barths.}, author={Meyer zu Hörste-Bührer,
Raphaela}, year={2021}, pages={133–154} }'
chicago: Meyer zu Hörste-Bührer, Raphaela. “Barth for Future? Eine Barth-Relektüre
Vor Dem Hintergrund Der Bewegung „Fridays for Future“.” Römerbrief Und Tageszeitung!
Politik in Der Theologie Karl Barths., 2021, 133–54.
ieee: R. Meyer zu Hörste-Bührer, “Barth for Future? Eine Barth-Relektüre vor dem
Hintergrund der Bewegung „Fridays for Future“.,” Römerbrief und Tageszeitung!
Politik in der Theologie Karl Barths., pp. 133–154, 2021.
mla: Meyer zu Hörste-Bührer, Raphaela. “Barth for Future? Eine Barth-Relektüre Vor
Dem Hintergrund Der Bewegung „Fridays for Future“.” Römerbrief Und Tageszeitung!
Politik in Der Theologie Karl Barths., 2021, pp. 133–54.
short: R. Meyer zu Hörste-Bührer, Römerbrief Und Tageszeitung! Politik in Der Theologie
Karl Barths. (2021) 133–154.
date_created: 2023-12-07T10:59:51Z
date_updated: 2023-12-13T07:30:17Z
language:
- iso: eng
page: 133-154
publication: Römerbrief und Tageszeitung! Politik in der Theologie Karl Barths.
status: public
title: Barth for Future? Eine Barth-Relektüre vor dem Hintergrund der Bewegung „Fridays
for Future“.
type: journal_article
user_id: '102100'
year: '2021'
...
---
_id: '48853'
abstract:
- lang: eng
text: In practise, it is often desirable to provide the decision-maker with a rich
set of diverse solutions of decent quality instead of just a single solution.
In this paper we study evolutionary diversity optimization for the knapsack problem
(KP). Our goal is to evolve a population of solutions that all have a profit of
at least (1 - {$ϵ$}) {$\cdot$} OPT, where OPT is the value of an optimal solution.
Furthermore, they should differ in structure with respect to an entropy-based
diversity measure. To this end we propose a simple ({$\mu$} + 1)-EA with initial
approximate solutions calculated by a well-known FPTAS for the KP. We investigate
the effect of different standard mutation operators and introduce biased mutation
and crossover which puts strong probability on flipping bits of low and/or high
frequency within the population. An experimental study on different instances
and settings shows that the proposed mutation operators in most cases perform
slightly inferior in the long term, but show strong benefits if the number of
function evaluations is severely limited.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Bossek J, Neumann A, Neumann F. Breeding Diverse Packings for the Knapsack
Problem by Means of Diversity-Tailored Evolutionary Algorithms. In: Proceedings
of the Genetic and Evolutionary Computation Conference. GECCO ’21. Association
for Computing Machinery; 2021:556–564. doi:10.1145/3449639.3459364'
apa: Bossek, J., Neumann, A., & Neumann, F. (2021). Breeding Diverse Packings
for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 556–564.
https://doi.org/10.1145/3449639.3459364
bibtex: '@inproceedings{Bossek_Neumann_Neumann_2021, place={New York, NY, USA},
series={GECCO ’21}, title={Breeding Diverse Packings for the Knapsack Problem
by Means of Diversity-Tailored Evolutionary Algorithms}, DOI={10.1145/3449639.3459364},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann,
Aneta and Neumann, Frank}, year={2021}, pages={556–564}, collection={GECCO ’21}
}'
chicago: 'Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Breeding Diverse Packings
for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.”
In Proceedings of the Genetic and Evolutionary Computation Conference,
556–564. GECCO ’21. New York, NY, USA: Association for Computing Machinery, 2021.
https://doi.org/10.1145/3449639.3459364.'
ieee: 'J. Bossek, A. Neumann, and F. Neumann, “Breeding Diverse Packings for the
Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms,” in Proceedings
of the Genetic and Evolutionary Computation Conference, 2021, pp. 556–564,
doi: 10.1145/3449639.3459364.'
mla: Bossek, Jakob, et al. “Breeding Diverse Packings for the Knapsack Problem by
Means of Diversity-Tailored Evolutionary Algorithms.” Proceedings of the Genetic
and Evolutionary Computation Conference, Association for Computing Machinery,
2021, pp. 556–564, doi:10.1145/3449639.3459364.
short: 'J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, New York, NY, USA,
2021, pp. 556–564.'
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:45:22Z
department:
- _id: '819'
doi: 10.1145/3449639.3459364
extern: '1'
keyword:
- evolutionary algorithms
- evolutionary diversity optimization
- knapsack problem
- tailored operators
language:
- iso: eng
page: 556–564
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-8350-9
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’21
status: public
title: Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored
Evolutionary Algorithms
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48855'
abstract:
- lang: eng
text: Computing sets of high quality solutions has gained increasing interest in
recent years. In this paper, we investigate how to obtain sets of optimal solutions
for the classical knapsack problem. We present an algorithm to count exactly the
number of optima to a zero-one knapsack problem instance. In addition, we show
how to efficiently sample uniformly at random from the set of all global optima.
In our experimental study, we investigate how the number of optima develops for
classical random benchmark instances dependent on their generator parameters.
We find that the number of global optima can increase exponentially for practically
relevant classes of instances with correlated weights and profits which poses
a justification for the considered exact counting problem.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Bossek J, Neumann A, Neumann F. Exact Counting and~Sampling of Optima for
the Knapsack Problem. In: Learning and Intelligent Optimization. Springer-Verlag;
2021:40–54. doi:10.1007/978-3-030-92121-7_4'
apa: Bossek, J., Neumann, A., & Neumann, F. (2021). Exact Counting and~Sampling
of Optima for the Knapsack Problem. Learning and Intelligent Optimization,
40–54. https://doi.org/10.1007/978-3-030-92121-7_4
bibtex: '@inproceedings{Bossek_Neumann_Neumann_2021, place={Berlin, Heidelberg},
title={Exact Counting and~Sampling of Optima for the Knapsack Problem}, DOI={10.1007/978-3-030-92121-7_4},
booktitle={Learning and Intelligent Optimization}, publisher={Springer-Verlag},
author={Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2021}, pages={40–54}
}'
chicago: 'Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Exact Counting And~Sampling
of Optima for the Knapsack Problem.” In Learning and Intelligent Optimization,
40–54. Berlin, Heidelberg: Springer-Verlag, 2021. https://doi.org/10.1007/978-3-030-92121-7_4.'
ieee: 'J. Bossek, A. Neumann, and F. Neumann, “Exact Counting and~Sampling of Optima
for the Knapsack Problem,” in Learning and Intelligent Optimization, 2021,
pp. 40–54, doi: 10.1007/978-3-030-92121-7_4.'
mla: Bossek, Jakob, et al. “Exact Counting And~Sampling of Optima for the Knapsack
Problem.” Learning and Intelligent Optimization, Springer-Verlag, 2021,
pp. 40–54, doi:10.1007/978-3-030-92121-7_4.
short: 'J. Bossek, A. Neumann, F. Neumann, in: Learning and Intelligent Optimization,
Springer-Verlag, Berlin, Heidelberg, 2021, pp. 40–54.'
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:45:14Z
department:
- _id: '819'
doi: 10.1007/978-3-030-92121-7_4
extern: '1'
keyword:
- Dynamic programming
- Exact counting
- Sampling
- Zero-one knapsack problem
language:
- iso: eng
page: 40–54
place: Berlin, Heidelberg
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-030-92120-0
publication_status: published
publisher: Springer-Verlag
status: public
title: Exact Counting and~Sampling of Optima for the Knapsack Problem
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48860'
abstract:
- lang: eng
text: In the area of evolutionary computation the calculation of diverse sets of
high-quality solutions to a given optimization problem has gained momentum in
recent years under the term evolutionary diversity optimization. Theoretical insights
into the working principles of baseline evolutionary algorithms for diversity
optimization are still rare. In this paper we study the well-known Minimum Spanning
Tree problem (MST) in the context of diversity optimization where population diversity
is measured by the sum of pairwise edge overlaps. Theoretical results provide
insights into the fitness landscape of the MST diversity optimization problem
pointing out that even for a population of {$\mu$} = 2 fitness plateaus (of constant
length) can be reached, but nevertheless diverse sets can be calculated in polynomial
time. We supplement our theoretical results with a series of experiments for the
unconstrained and constraint case where all solutions need to fulfill a minimal
quality threshold. Our results show that a simple ({$\mu$} + 1)-EA can effectively
compute a diversified population of spanning trees of high quality.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Bossek J, Neumann F. Evolutionary Diversity Optimization and the Minimum Spanning
Tree Problem. In: Proceedings of the Genetic and Evolutionary Computation Conference.
GECCO ’21. Association for Computing Machinery; 2021:198–206. doi:10.1145/3449639.3459363'
apa: Bossek, J., & Neumann, F. (2021). Evolutionary Diversity Optimization and
the Minimum Spanning Tree Problem. Proceedings of the Genetic and Evolutionary
Computation Conference, 198–206. https://doi.org/10.1145/3449639.3459363
bibtex: '@inproceedings{Bossek_Neumann_2021, place={New York, NY, USA}, series={GECCO
’21}, title={Evolutionary Diversity Optimization and the Minimum Spanning Tree
Problem}, DOI={10.1145/3449639.3459363},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann,
Frank}, year={2021}, pages={198–206}, collection={GECCO ’21} }'
chicago: 'Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization
and the Minimum Spanning Tree Problem.” In Proceedings of the Genetic and Evolutionary
Computation Conference, 198–206. GECCO ’21. New York, NY, USA: Association
for Computing Machinery, 2021. https://doi.org/10.1145/3449639.3459363.'
ieee: 'J. Bossek and F. Neumann, “Evolutionary Diversity Optimization and the Minimum
Spanning Tree Problem,” in Proceedings of the Genetic and Evolutionary Computation
Conference, 2021, pp. 198–206, doi: 10.1145/3449639.3459363.'
mla: Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization and
the Minimum Spanning Tree Problem.” Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, 2021, pp. 198–206,
doi:10.1145/3449639.3459363.
short: 'J. Bossek, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation
Conference, Association for Computing Machinery, New York, NY, USA, 2021, pp.
198–206.'
date_created: 2023-11-14T15:58:55Z
date_updated: 2023-12-13T10:45:37Z
department:
- _id: '819'
doi: 10.1145/3449639.3459363
extern: '1'
keyword:
- evolutionary algorithms
- evolutionary diversity optimization
- minimum spanning tree
- runtime analysis
language:
- iso: eng
page: 198–206
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-8350-9
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’21
status: public
title: Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48862'
abstract:
- lang: eng
text: 'Most runtime analyses of randomised search heuristics focus on the expected
number of function evaluations to find a unique global optimum. We ask a fundamental
question: if additional search points are declared optimal, or declared as desirable
target points, do these additional optima speed up evolutionary algorithms? More
formally, we analyse the expected hitting time of a target set OPT {$\cup$} S
where S is a set of non-optimal search points and OPT is the set of optima and
compare it to the expected hitting time of OPT. We show that the answer to our
question depends on the number and placement of search points in S. For all black-box
algorithms and all fitness functions we show that, if additional optima are placed
randomly, even an exponential number of optima has a negligible effect on the
expected optimisation time. Considering Hamming balls around all global optima
gives an easier target for some algorithms and functions and can shift the phase
transition with respect to offspring population sizes in the (1,{$\lambda$}) EA
on One-Max. Finally, on functions where search trajectories typically join in
a single search point, turning one search point into an optimum drastically reduces
the expected optimisation time.'
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Dirk
full_name: Sudholt, Dirk
last_name: Sudholt
citation:
ama: 'Bossek J, Sudholt D. Do Additional Optima Speed up Evolutionary Algorithms?
In: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms. Association for Computing Machinery; 2021:1–11.'
apa: Bossek, J., & Sudholt, D. (2021). Do Additional Optima Speed up Evolutionary
Algorithms? In Proceedings of the 16th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms (pp. 1–11). Association for Computing Machinery.
bibtex: '@inbook{Bossek_Sudholt_2021, place={New York, NY, USA}, title={Do Additional
Optima Speed up Evolutionary Algorithms?}, booktitle={Proceedings of the 16th
ACM/SIGEVO Conference on Foundations of Genetic Algorithms}, publisher={Association
for Computing Machinery}, author={Bossek, Jakob and Sudholt, Dirk}, year={2021},
pages={1–11} }'
chicago: 'Bossek, Jakob, and Dirk Sudholt. “Do Additional Optima Speed up Evolutionary
Algorithms?” In Proceedings of the 16th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms, 1–11. New York, NY, USA: Association for Computing
Machinery, 2021.'
ieee: 'J. Bossek and D. Sudholt, “Do Additional Optima Speed up Evolutionary Algorithms?,”
in Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms, New York, NY, USA: Association for Computing Machinery, 2021,
pp. 1–11.'
mla: Bossek, Jakob, and Dirk Sudholt. “Do Additional Optima Speed up Evolutionary
Algorithms?” Proceedings of the 16th ACM/SIGEVO Conference on Foundations of
Genetic Algorithms, Association for Computing Machinery, 2021, pp. 1–11.
short: 'J. Bossek, D. Sudholt, in: Proceedings of the 16th ACM/SIGEVO Conference
on Foundations of Genetic Algorithms, Association for Computing Machinery, New
York, NY, USA, 2021, pp. 1–11.'
date_created: 2023-11-14T15:58:55Z
date_updated: 2023-12-13T10:45:31Z
department:
- _id: '819'
extern: '1'
keyword:
- evolutionary algorithms
- pseudo-boolean functions
- runtime analysis
- theory
language:
- iso: eng
page: 1–11
place: New York, NY, USA
publication: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms
publication_identifier:
isbn:
- 978-1-4503-8352-3
publication_status: published
publisher: Association for Computing Machinery
status: public
title: Do Additional Optima Speed up Evolutionary Algorithms?
type: book_chapter
user_id: '102979'
year: '2021'
...
---
_id: '48881'
abstract:
- lang: eng
text: 'Classic automated algorithm selection (AS) for (combinatorial) optimization
problems heavily relies on so-called instance features, i.e., numerical characteristics
of the problem at hand ideally extracted with computationally low-demanding routines.
For the traveling salesperson problem (TSP) a plethora of features have been suggested.
Most of these features are, if at all, only normalized imprecisely raising the
issue of feature values being strongly affected by the instance size. Such artifacts
may have detrimental effects on algorithm selection models. We propose a normalization
for two feature groups which stood out in multiple AS studies on the TSP: (a)
features based on a minimum spanning tree (MST) and (b) a k-nearest neighbor graph
(NNG) transformation of the input instance. To this end we theoretically derive
minimum and maximum values for properties of MSTs and k-NNGs of Euclidean graphs.
We analyze the differences in feature space between normalized versions of these
features and their unnormalized counterparts. Our empirical investigations on
various TSP benchmark sets point out that the feature scaling succeeds in eliminating
the effect of the instance size. Eventually, a proof-of-concept AS-study shows
promising results: models trained with normalized features tend to outperform
those trained with the respective vanilla features.'
author:
- first_name: Jonathan
full_name: Heins, Jonathan
last_name: Heins
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Janina
full_name: Pohl, Janina
last_name: Pohl
- first_name: Moritz
full_name: Seiler, Moritz
last_name: Seiler
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
citation:
ama: 'Heins J, Bossek J, Pohl J, Seiler M, Trautmann H, Kerschke P. On the Potential
of Normalized TSP Features for Automated Algorithm Selection. In: Proceedings
of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. Association
for Computing Machinery; 2021:1–15.'
apa: Heins, J., Bossek, J., Pohl, J., Seiler, M., Trautmann, H., & Kerschke,
P. (2021). On the Potential of Normalized TSP Features for Automated Algorithm
Selection. In Proceedings of the 16th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms (pp. 1–15). Association for Computing Machinery.
bibtex: '@inbook{Heins_Bossek_Pohl_Seiler_Trautmann_Kerschke_2021, place={New York,
NY, USA}, title={On the Potential of Normalized TSP Features for Automated Algorithm
Selection}, booktitle={Proceedings of the 16th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms}, publisher={Association for Computing Machinery}, author={Heins,
Jonathan and Bossek, Jakob and Pohl, Janina and Seiler, Moritz and Trautmann,
Heike and Kerschke, Pascal}, year={2021}, pages={1–15} }'
chicago: 'Heins, Jonathan, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann,
and Pascal Kerschke. “On the Potential of Normalized TSP Features for Automated
Algorithm Selection.” In Proceedings of the 16th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms, 1–15. New York, NY, USA: Association for Computing
Machinery, 2021.'
ieee: 'J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, and P. Kerschke, “On
the Potential of Normalized TSP Features for Automated Algorithm Selection,” in
Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms,
New York, NY, USA: Association for Computing Machinery, 2021, pp. 1–15.'
mla: Heins, Jonathan, et al. “On the Potential of Normalized TSP Features for Automated
Algorithm Selection.” Proceedings of the 16th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms, Association for Computing Machinery, 2021, pp. 1–15.
short: 'J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, P. Kerschke, in:
Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms,
Association for Computing Machinery, New York, NY, USA, 2021, pp. 1–15.'
date_created: 2023-11-14T15:58:58Z
date_updated: 2023-12-13T10:47:23Z
department:
- _id: '819'
extern: '1'
keyword:
- automated algorithm selection
- graph theory
- instance features
- normalization
- traveling salesperson problem (TSP)
language:
- iso: eng
page: 1–15
place: New York, NY, USA
publication: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms
publication_identifier:
isbn:
- 978-1-4503-8352-3
publisher: Association for Computing Machinery
status: public
title: On the Potential of Normalized TSP Features for Automated Algorithm Selection
type: book_chapter
user_id: '102979'
year: '2021'
...
---
_id: '48876'
abstract:
- lang: eng
text: In recent years, Evolutionary Algorithms (EAs) have frequently been adopted
to evolve instances for optimization problems that pose difficulties for one algorithm
while being rather easy for a competitor and vice versa. Typically, this is achieved
by either minimizing or maximizing the performance difference or ratio which serves
as the fitness function. Repeating this process is useful to gain insights into
strengths/weaknesses of certain algorithms or to build a set of instances with
strong performance differences as a foundation for automatic per-instance algorithm
selection or configuration. We contribute to this branch of research by proposing
fitness-functions to evolve instances that show large performance differences
for more than just two algorithms simultaneously. As a proof-of-principle, we
evolve instances of the multi-component Traveling Thief Problem (TTP) for three
incomplete TTP-solvers. Our results point out that our strategies are promising,
but unsurprisingly their success strongly relies on the algorithms’ performance
complementarity.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
citation:
ama: 'Bossek J, Wagner M. Generating Instances with Performance Differences for
More than Just Two Algorithms. In: Proceedings of the Genetic and Evolutionary
Computation Conference Companion. GECCO’21. Association for Computing Machinery;
2021:1423–1432. doi:10.1145/3449726.3463165'
apa: Bossek, J., & Wagner, M. (2021). Generating Instances with Performance
Differences for More than Just Two Algorithms. Proceedings of the Genetic and
Evolutionary Computation Conference Companion, 1423–1432. https://doi.org/10.1145/3449726.3463165
bibtex: '@inproceedings{Bossek_Wagner_2021, place={New York, NY, USA}, series={GECCO’21},
title={Generating Instances with Performance Differences for More than Just Two
Algorithms}, DOI={10.1145/3449726.3463165},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference
Companion}, publisher={Association for Computing Machinery}, author={Bossek, Jakob
and Wagner, Markus}, year={2021}, pages={1423–1432}, collection={GECCO’21} }'
chicago: 'Bossek, Jakob, and Markus Wagner. “Generating Instances with Performance
Differences for More than Just Two Algorithms.” In Proceedings of the Genetic
and Evolutionary Computation Conference Companion, 1423–1432. GECCO’21. New
York, NY, USA: Association for Computing Machinery, 2021. https://doi.org/10.1145/3449726.3463165.'
ieee: 'J. Bossek and M. Wagner, “Generating Instances with Performance Differences
for More than Just Two Algorithms,” in Proceedings of the Genetic and Evolutionary
Computation Conference Companion, 2021, pp. 1423–1432, doi: 10.1145/3449726.3463165.'
mla: Bossek, Jakob, and Markus Wagner. “Generating Instances with Performance Differences
for More than Just Two Algorithms.” Proceedings of the Genetic and Evolutionary
Computation Conference Companion, Association for Computing Machinery, 2021,
pp. 1423–1432, doi:10.1145/3449726.3463165.
short: 'J. Bossek, M. Wagner, in: Proceedings of the Genetic and Evolutionary Computation
Conference Companion, Association for Computing Machinery, New York, NY, USA,
2021, pp. 1423–1432.'
date_created: 2023-11-14T15:58:57Z
date_updated: 2023-12-13T10:47:41Z
department:
- _id: '819'
doi: 10.1145/3449726.3463165
extern: '1'
keyword:
- evolutionary algorithms
- evolving instances
- fitness function
- instance hardness
- traveling thief problem (TTP)
language:
- iso: eng
page: 1423–1432
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference Companion
publication_identifier:
isbn:
- 978-1-4503-8351-6
publisher: Association for Computing Machinery
series_title: GECCO’21
status: public
title: Generating Instances with Performance Differences for More than Just Two Algorithms
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48893'
abstract:
- lang: eng
text: Computing diverse sets of high-quality solutions has gained increasing attention
among the evolutionary computation community in recent years. It allows practitioners
to choose from a set of high-quality alternatives. In this paper, we employ a
population diversity measure, called the high-order entropy measure, in an evolutionary
algorithm to compute a diverse set of high-quality solutions for the Traveling
Salesperson Problem. In contrast to previous studies, our approach allows diversifying
segments of tours containing several edges based on the entropy measure. We examine
the resulting evolutionary diversity optimisation approach precisely in terms
of the final set of solutions and theoretical properties. Experimental results
show significant improvements compared to a recently proposed edge-based diversity
optimisation approach when working with a large population of solutions or long
segments.
author:
- first_name: Adel
full_name: Nikfarjam, Adel
last_name: Nikfarjam
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Nikfarjam A, Bossek J, Neumann A, Neumann F. Entropy-Based Evolutionary Diversity
Optimisation for the Traveling Salesperson Problem. In: Proceedings of the
Genetic and Evolutionary Computation Conference. GECCO’21. Association for
Computing Machinery; 2021:600–608. doi:10.1145/3449639.3459384'
apa: Nikfarjam, A., Bossek, J., Neumann, A., & Neumann, F. (2021). Entropy-Based
Evolutionary Diversity Optimisation for the Traveling Salesperson Problem. Proceedings
of the Genetic and Evolutionary Computation Conference, 600–608. https://doi.org/10.1145/3449639.3459384
bibtex: '@inproceedings{Nikfarjam_Bossek_Neumann_Neumann_2021, place={New York,
NY, USA}, series={GECCO’21}, title={Entropy-Based Evolutionary Diversity Optimisation
for the Traveling Salesperson Problem}, DOI={10.1145/3449639.3459384},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Nikfarjam, Adel and Bossek,
Jakob and Neumann, Aneta and Neumann, Frank}, year={2021}, pages={600–608}, collection={GECCO’21}
}'
chicago: 'Nikfarjam, Adel, Jakob Bossek, Aneta Neumann, and Frank Neumann. “Entropy-Based
Evolutionary Diversity Optimisation for the Traveling Salesperson Problem.” In
Proceedings of the Genetic and Evolutionary Computation Conference, 600–608.
GECCO’21. New York, NY, USA: Association for Computing Machinery, 2021. https://doi.org/10.1145/3449639.3459384.'
ieee: 'A. Nikfarjam, J. Bossek, A. Neumann, and F. Neumann, “Entropy-Based Evolutionary
Diversity Optimisation for the Traveling Salesperson Problem,” in Proceedings
of the Genetic and Evolutionary Computation Conference, 2021, pp. 600–608,
doi: 10.1145/3449639.3459384.'
mla: Nikfarjam, Adel, et al. “Entropy-Based Evolutionary Diversity Optimisation
for the Traveling Salesperson Problem.” Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, 2021, pp. 600–608,
doi:10.1145/3449639.3459384.
short: 'A. Nikfarjam, J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the
Genetic and Evolutionary Computation Conference, Association for Computing Machinery,
New York, NY, USA, 2021, pp. 600–608.'
date_created: 2023-11-14T15:59:00Z
date_updated: 2023-12-13T10:50:06Z
department:
- _id: '819'
doi: 10.1145/3449639.3459384
extern: '1'
keyword:
- evolutionary algorithms
- evolutionary diversity optimisation
- high-order entropy
- traveling salesperson problem
language:
- iso: eng
page: 600–608
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-8350-9
publisher: Association for Computing Machinery
series_title: GECCO’21
status: public
title: Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson
Problem
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48891'
abstract:
- lang: eng
text: Submodular functions allow to model many real-world optimisation problems.
This paper introduces approaches for computing diverse sets of high quality solutions
for submodular optimisation problems with uniform and knapsack constraints. We
first present diversifying greedy sampling approaches and analyse them with respect
to the diversity measured by entropy and the approximation quality of the obtained
solutions. Afterwards, we introduce an evolutionary diversity optimisation (EDO)
approach to further improve diversity of the set of solutions. We carry out experimental
investigations on popular submodular benchmark problems and analyse trade-offs
in terms of solution quality and diversity of the resulting solution sets.
author:
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Neumann A, Bossek J, Neumann F. Diversifying Greedy Sampling and Evolutionary
Diversity Optimisation for Constrained Monotone Submodular Functions. In: Proceedings
of the Genetic and Evolutionary Computation Conference. GECCO’21. Association
for Computing Machinery; 2021:261–269. doi:10.1145/3449639.3459385'
apa: Neumann, A., Bossek, J., & Neumann, F. (2021). Diversifying Greedy Sampling
and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions.
Proceedings of the Genetic and Evolutionary Computation Conference, 261–269.
https://doi.org/10.1145/3449639.3459385
bibtex: '@inproceedings{Neumann_Bossek_Neumann_2021, place={New York, NY, USA},
series={GECCO’21}, title={Diversifying Greedy Sampling and Evolutionary Diversity
Optimisation for Constrained Monotone Submodular Functions}, DOI={10.1145/3449639.3459385},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Neumann, Aneta and Bossek,
Jakob and Neumann, Frank}, year={2021}, pages={261–269}, collection={GECCO’21}
}'
chicago: 'Neumann, Aneta, Jakob Bossek, and Frank Neumann. “Diversifying Greedy
Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular
Functions.” In Proceedings of the Genetic and Evolutionary Computation Conference,
261–269. GECCO’21. New York, NY, USA: Association for Computing Machinery, 2021.
https://doi.org/10.1145/3449639.3459385.'
ieee: 'A. Neumann, J. Bossek, and F. Neumann, “Diversifying Greedy Sampling and
Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions,”
in Proceedings of the Genetic and Evolutionary Computation Conference,
2021, pp. 261–269, doi: 10.1145/3449639.3459385.'
mla: Neumann, Aneta, et al. “Diversifying Greedy Sampling and Evolutionary Diversity
Optimisation for Constrained Monotone Submodular Functions.” Proceedings of
the Genetic and Evolutionary Computation Conference, Association for Computing
Machinery, 2021, pp. 261–269, doi:10.1145/3449639.3459385.
short: 'A. Neumann, J. Bossek, F. Neumann, in: Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, New York, NY, USA,
2021, pp. 261–269.'
date_created: 2023-11-14T15:58:59Z
date_updated: 2023-12-13T10:49:25Z
department:
- _id: '819'
doi: 10.1145/3449639.3459385
extern: '1'
keyword:
- evolutionary algorithms
- evolutionary diversity optimisation
- sub-modular functions
language:
- iso: eng
page: 261–269
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-8350-9
publisher: Association for Computing Machinery
series_title: GECCO’21
status: public
title: Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained
Monotone Submodular Functions
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48892'
abstract:
- lang: eng
text: Evolutionary algorithms based on edge assembly crossover (EAX) constitute
some of the best performing incomplete solvers for the well-known traveling salesperson
problem (TSP). Often, it is desirable to compute not just a single solution for
a given problem, but a diverse set of high quality solutions from which a decision
maker can choose one for implementation. Currently, there are only a few approaches
for computing a diverse solution set for the TSP. Furthermore, almost all of them
assume that the optimal solution is known. In this paper, we introduce evolutionary
diversity optimisation (EDO) approaches for the TSP that find a diverse set of
tours when the optimal tour is known or unknown. We show how to adopt EAX to not
only find a high-quality solution but also to maximise the diversity of the population.
The resulting EAX-based EDO approach, termed EAX-EDO is capable of obtaining diverse
high-quality tours when the optimal solution for the TSP is known or unknown.
A comparison to existing approaches shows that they are clearly outperformed by
EAX-EDO.
author:
- first_name: Adel
full_name: Nikfarjam, Adel
last_name: Nikfarjam
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Nikfarjam A, Bossek J, Neumann A, Neumann F. Computing Diverse Sets of High
Quality TSP Tours by EAX-based Evolutionary Diversity Optimisation. In: Proceedings
of the 16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms. Association
for Computing Machinery; 2021:1–11.'
apa: Nikfarjam, A., Bossek, J., Neumann, A., & Neumann, F. (2021). Computing
Diverse Sets of High Quality TSP Tours by EAX-based Evolutionary Diversity Optimisation.
In Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic
Algorithms (pp. 1–11). Association for Computing Machinery.
bibtex: '@inbook{Nikfarjam_Bossek_Neumann_Neumann_2021, place={New York, NY, USA},
title={Computing Diverse Sets of High Quality TSP Tours by EAX-based Evolutionary
Diversity Optimisation}, booktitle={Proceedings of the 16th ACM}/SIGEVO Conference
on Foundations of Genetic Algorithms}, publisher={Association for Computing Machinery},
author={Nikfarjam, Adel and Bossek, Jakob and Neumann, Aneta and Neumann, Frank},
year={2021}, pages={1–11} }'
chicago: 'Nikfarjam, Adel, Jakob Bossek, Aneta Neumann, and Frank Neumann. “Computing
Diverse Sets of High Quality TSP Tours by EAX-Based Evolutionary Diversity Optimisation.”
In Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic
Algorithms, 1–11. New York, NY, USA: Association for Computing Machinery,
2021.'
ieee: 'A. Nikfarjam, J. Bossek, A. Neumann, and F. Neumann, “Computing Diverse Sets
of High Quality TSP Tours by EAX-based Evolutionary Diversity Optimisation,” in
Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms,
New York, NY, USA: Association for Computing Machinery, 2021, pp. 1–11.'
mla: Nikfarjam, Adel, et al. “Computing Diverse Sets of High Quality TSP Tours by
EAX-Based Evolutionary Diversity Optimisation.” Proceedings of the 16th ACM}/SIGEVO
Conference on Foundations of Genetic Algorithms, Association for Computing
Machinery, 2021, pp. 1–11.
short: 'A. Nikfarjam, J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the
16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms, Association
for Computing Machinery, New York, NY, USA, 2021, pp. 1–11.'
date_created: 2023-11-14T15:59:00Z
date_updated: 2023-12-13T10:49:59Z
department:
- _id: '819'
extern: '1'
keyword:
- edge assembly crossover (EAX)
- evolutionary algorithms
- evolutionary diversity optimisation (EDO)
- traveling salesperson problem (TSP)
language:
- iso: eng
page: 1–11
place: New York, NY, USA
publication: Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic
Algorithms
publication_identifier:
isbn:
- 978-1-4503-8352-3
publisher: Association for Computing Machinery
status: public
title: Computing Diverse Sets of High Quality TSP Tours by EAX-based Evolutionary
Diversity Optimisation
type: book_chapter
user_id: '102979'
year: '2021'
...
---
_id: '48854'
abstract:
- lang: eng
text: We contribute to the theoretical understanding of randomized search heuristics
for dynamic problems. We consider the classical vertex coloring problem on graphs
and investigate the dynamic setting where edges are added to the current graph.
We then analyze the expected time for randomized search heuristics to recompute
high quality solutions. The (1+1) Evolutionary Algorithm and RLS operate in a
setting where the number of colors is bounded and we are minimizing the number
of conflicts. Iterated local search algorithms use an unbounded color palette
and aim to use the smallest colors and, consequently, the smallest number of colors.
We identify classes of bipartite graphs where reoptimization is as hard as or
even harder than optimization from scratch, i.e., starting with a random initialization.
Even adding a single edge can lead to hard symmetry problems. However, graph classes
that are hard for one algorithm turn out to be easy for others. In most cases
our bounds show that reoptimization is faster than optimizing from scratch. We
further show that tailoring mutation operators to parts of the graph where changes
have occurred can significantly reduce the expected reoptimization time. In most
settings the expected reoptimization time for such tailored algorithms is linear
in the number of added edges. However, tailored algorithms cannot prevent exponential
times in settings where the original algorithm is inefficient.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
- first_name: Pan
full_name: Peng, Pan
last_name: Peng
- first_name: Dirk
full_name: Sudholt, Dirk
last_name: Sudholt
citation:
ama: Bossek J, Neumann F, Peng P, Sudholt D. Time Complexity Analysis of Randomized
Search Heuristics for the Dynamic Graph Coloring Problem. Algorithmica.
2021;83(10):3148–3179. doi:10.1007/s00453-021-00838-3
apa: Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2021). Time Complexity
Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.
Algorithmica, 83(10), 3148–3179. https://doi.org/10.1007/s00453-021-00838-3
bibtex: '@article{Bossek_Neumann_Peng_Sudholt_2021, title={Time Complexity Analysis
of Randomized Search Heuristics for the Dynamic Graph Coloring Problem}, volume={83},
DOI={10.1007/s00453-021-00838-3},
number={10}, journal={Algorithmica}, author={Bossek, Jakob and Neumann, Frank
and Peng, Pan and Sudholt, Dirk}, year={2021}, pages={3148–3179} }'
chicago: 'Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Time Complexity
Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.”
Algorithmica 83, no. 10 (2021): 3148–3179. https://doi.org/10.1007/s00453-021-00838-3.'
ieee: 'J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Time Complexity Analysis
of Randomized Search Heuristics for the Dynamic Graph Coloring Problem,” Algorithmica,
vol. 83, no. 10, pp. 3148–3179, 2021, doi: 10.1007/s00453-021-00838-3.'
mla: Bossek, Jakob, et al. “Time Complexity Analysis of Randomized Search Heuristics
for the Dynamic Graph Coloring Problem.” Algorithmica, vol. 83, no. 10,
2021, pp. 3148–3179, doi:10.1007/s00453-021-00838-3.
short: J. Bossek, F. Neumann, P. Peng, D. Sudholt, Algorithmica 83 (2021) 3148–3179.
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:51:34Z
department:
- _id: '819'
doi: 10.1007/s00453-021-00838-3
intvolume: ' 83'
issue: '10'
keyword:
- Dynamic optimization
- Evolutionary algorithms
- Running time analysis
language:
- iso: eng
page: 3148–3179
publication: Algorithmica
publication_identifier:
issn:
- 0178-4617
status: public
title: Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph
Coloring Problem
type: journal_article
user_id: '102979'
volume: 83
year: '2021'
...
---
_id: '49589'
author:
- first_name: Daniel
full_name: Fastlabend-Vargas, Daniel
id: '23102'
last_name: Fastlabend-Vargas
citation:
ama: 'Fastlabend-Vargas D. Rezension zu: Dräger, Marco: Denkmäler im Geschichtsunterricht
Frankfurt am Main 2021. H-Soz-Kult . Published online 2021.'
apa: 'Fastlabend-Vargas, D. (2021). Rezension zu: Dräger, Marco: Denkmäler im Geschichtsunterricht
Frankfurt am Main 2021. In H-Soz-Kult .'
bibtex: '@article{Fastlabend-Vargas_2021, place={www.hsozkult.de/publicationreview/id/reb-97453},
title={Rezension zu: Dräger, Marco: Denkmäler im Geschichtsunterricht Frankfurt
am Main 2021.}, journal={H-Soz-Kult }, author={Fastlabend-Vargas, Daniel}, year={2021}
}'
chicago: 'Fastlabend-Vargas, Daniel. “Rezension zu: Dräger, Marco: Denkmäler im
Geschichtsunterricht Frankfurt am Main 2021.” H-Soz-Kult . www.hsozkult.de/publicationreview/id/reb-97453,
2021.'
ieee: 'D. Fastlabend-Vargas, “Rezension zu: Dräger, Marco: Denkmäler im Geschichtsunterricht
Frankfurt am Main 2021.,” H-Soz-Kult . www.hsozkult.de/publicationreview/id/reb-97453,
2021.'
mla: 'Fastlabend-Vargas, Daniel. “Rezension zu: Dräger, Marco: Denkmäler im Geschichtsunterricht
Frankfurt am Main 2021.” H-Soz-Kult , 2021.'
short: D. Fastlabend-Vargas, H-Soz-Kult (2021).
date_created: 2023-12-13T11:44:54Z
date_updated: 2023-12-13T11:46:29Z
department:
- _id: '6'
- _id: '444'
language:
- iso: ger
main_file_link:
- open_access: '1'
url: https://www.hsozkult.de/publicationreview/id/reb-97453
oa: '1'
place: www.hsozkult.de/publicationreview/id/reb-97453
publication: 'H-Soz-Kult '
publication_date: 10.08.2021
publication_status: published
status: public
title: 'Rezension zu: Dräger, Marco: Denkmäler im Geschichtsunterricht Frankfurt am
Main 2021.'
type: review
user_id: '23102'
year: '2021'
...
---
_id: '23469'
abstract:
- lang: eng
text: The implementation of control systems in metal forming processes improves
product quality and productivity. By controlling workpiece properties during the
process, beneficial effects caused by forming can be exploited and integrated
in the product design. The overall goal of this investigation is to produce tailored
tubular parts with a defined locally graded microstructure by means of reverse
flow forming. For this purpose, the proposed system aims to control both the desired
geometry of the workpiece and additionally the formation of strain-induced α′-martensite
content in the metastable austenitic stainless steel AISI 304 L. The paper introduces
an overall control scheme, a geometry model for describing the process and changes
in the dimensions of the workpiece, as well as a material model for the process-induced
formation of martensite, providing equations based on empirical data. Moreover,
measurement systems providing a closed feedback loop are presented, including
a novel softsensor for in-situ measurements of the martensite content.
article_number: '100057'
author:
- first_name: Markus
full_name: Riepold, Markus
last_name: Riepold
- first_name: Bahman
full_name: Arian, Bahman
id: '36287'
last_name: Arian
- first_name: Julian Rozo
full_name: Vasquez, Julian Rozo
last_name: Vasquez
- first_name: Werner
full_name: Homberg, Werner
id: '233'
last_name: Homberg
- first_name: Frank
full_name: Walther, Frank
last_name: Walther
- first_name: Ansgar
full_name: Trächtler, Ansgar
id: '552'
last_name: Trächtler
citation:
ama: Riepold M, Arian B, Vasquez JR, Homberg W, Walther F, Trächtler A. Model approaches
for closed-loop property control for flow forming. Advances in Industrial and
Manufacturing Engineering. Published online 2021. doi:10.1016/j.aime.2021.100057
apa: Riepold, M., Arian, B., Vasquez, J. R., Homberg, W., Walther, F., & Trächtler,
A. (2021). Model approaches for closed-loop property control for flow forming.
Advances in Industrial and Manufacturing Engineering, Article 100057. https://doi.org/10.1016/j.aime.2021.100057
bibtex: '@article{Riepold_Arian_Vasquez_Homberg_Walther_Trächtler_2021, title={Model
approaches for closed-loop property control for flow forming}, DOI={10.1016/j.aime.2021.100057},
number={100057}, journal={Advances in Industrial and Manufacturing Engineering},
author={Riepold, Markus and Arian, Bahman and Vasquez, Julian Rozo and Homberg,
Werner and Walther, Frank and Trächtler, Ansgar}, year={2021} }'
chicago: Riepold, Markus, Bahman Arian, Julian Rozo Vasquez, Werner Homberg, Frank
Walther, and Ansgar Trächtler. “Model Approaches for Closed-Loop Property Control
for Flow Forming.” Advances in Industrial and Manufacturing Engineering,
2021. https://doi.org/10.1016/j.aime.2021.100057.
ieee: 'M. Riepold, B. Arian, J. R. Vasquez, W. Homberg, F. Walther, and A. Trächtler,
“Model approaches for closed-loop property control for flow forming,” Advances
in Industrial and Manufacturing Engineering, Art. no. 100057, 2021, doi: 10.1016/j.aime.2021.100057.'
mla: Riepold, Markus, et al. “Model Approaches for Closed-Loop Property Control
for Flow Forming.” Advances in Industrial and Manufacturing Engineering,
100057, 2021, doi:10.1016/j.aime.2021.100057.
short: M. Riepold, B. Arian, J.R. Vasquez, W. Homberg, F. Walther, A. Trächtler,
Advances in Industrial and Manufacturing Engineering (2021).
date_created: 2021-08-23T13:23:05Z
date_updated: 2023-12-15T09:39:21Z
department:
- _id: '156'
- _id: '153'
- _id: '241'
doi: 10.1016/j.aime.2021.100057
language:
- iso: eng
main_file_link:
- open_access: '1'
oa: '1'
publication: Advances in Industrial and Manufacturing Engineering
publication_identifier:
issn:
- 2666-9129
publication_status: published
quality_controlled: '1'
status: public
title: Model approaches for closed-loop property control for flow forming
type: journal_article
user_id: '36287'
year: '2021'
...
---
_id: '49759'
author:
- first_name: Yves
full_name: Huybrechts, Yves
id: '78579'
last_name: Huybrechts
orcid: 0009-0009-2166-9794
- first_name: Peter
full_name: Scholliers, Peter
last_name: Scholliers
citation:
ama: Huybrechts Y, Scholliers P. “Searching for a Belgian Culinary Identity -
Referat von Prof. Dr. Peter Scholliers” (VIDEO). BelgienNet; 2021.
apa: Huybrechts, Y., & Scholliers, P. (2021). “Searching for a Belgian culinary
identity - Referat von Prof. Dr. Peter Scholliers” (VIDEO). BelgienNet.
bibtex: '@book{Huybrechts_Scholliers_2021, series={5. Belgientag (10. Mai 2023 in
Paderborn)}, title={“Searching for a Belgian culinary identity - Referat von Prof.
Dr. Peter Scholliers” (VIDEO)}, publisher={BelgienNet}, author={Huybrechts, Yves
and Scholliers, Peter}, year={2021}, collection={5. Belgientag (10. Mai 2023 in
Paderborn)} }'
chicago: Huybrechts, Yves, and Peter Scholliers. “Searching for a Belgian Culinary
Identity - Referat von Prof. Dr. Peter Scholliers” (VIDEO). 5. Belgientag
(10. Mai 2023 in Paderborn). BelgienNet, 2021.
ieee: Y. Huybrechts and P. Scholliers, “Searching for a Belgian culinary identity
- Referat von Prof. Dr. Peter Scholliers” (VIDEO). BelgienNet, 2021.
mla: Huybrechts, Yves, and Peter Scholliers. “Searching for a Belgian Culinary
Identity - Referat von Prof. Dr. Peter Scholliers” (VIDEO). BelgienNet, 2021.
short: Y. Huybrechts, P. Scholliers, “Searching for a Belgian Culinary Identity
- Referat von Prof. Dr. Peter Scholliers” (VIDEO), BelgienNet, 2021.
date_created: 2023-12-18T09:54:49Z
date_updated: 2023-12-18T10:08:24Z
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://belgien.net/belgian-culinary-identity/
oa: '1'
publication_status: published
publisher: BelgienNet
series_title: 5. Belgientag (10. Mai 2023 in Paderborn)
status: public
title: '"Searching for a Belgian culinary identity - Referat von Prof. Dr. Peter Scholliers"
(VIDEO)'
type: misc
user_id: '78579'
year: '2021'
...
---
_id: '49765'
author:
- first_name: Yves
full_name: Huybrechts, Yves
id: '78579'
last_name: Huybrechts
orcid: 0009-0009-2166-9794
citation:
ama: Huybrechts Y. “Der belgische Symbolismus - Interview mit dem Direktor der
Alten Nationalgalerie, Dr. Ralph Gleis” (PODCAST). BelgienNet; 2021.
apa: Huybrechts, Y. (2021). “Der belgische Symbolismus - Interview mit dem Direktor
der Alten Nationalgalerie, Dr. Ralph Gleis” (PODCAST). BelgienNet.
bibtex: '@book{Huybrechts_2021, title={“Der belgische Symbolismus - Interview mit
dem Direktor der Alten Nationalgalerie, Dr. Ralph Gleis” (PODCAST)}, publisher={BelgienNet},
author={Huybrechts, Yves}, year={2021} }'
chicago: Huybrechts, Yves. “Der belgische Symbolismus - Interview mit dem Direktor
der Alten Nationalgalerie, Dr. Ralph Gleis” (PODCAST). BelgienNet, 2021.
ieee: Y. Huybrechts, “Der belgische Symbolismus - Interview mit dem Direktor
der Alten Nationalgalerie, Dr. Ralph Gleis” (PODCAST). BelgienNet, 2021.
mla: Huybrechts, Yves. “Der belgische Symbolismus - Interview mit dem Direktor
der Alten Nationalgalerie, Dr. Ralph Gleis” (PODCAST). BelgienNet, 2021.
short: Y. Huybrechts, “Der belgische Symbolismus - Interview mit dem Direktor der
Alten Nationalgalerie, Dr. Ralph Gleis” (PODCAST), BelgienNet, 2021.
date_created: 2023-12-18T09:58:47Z
date_updated: 2023-12-18T10:08:17Z
department:
- _id: '448'
language:
- iso: ger
main_file_link:
- open_access: '1'
url: https://belgien.net/der-belgische-symbolismus-interview/
oa: '1'
publication_status: published
publisher: BelgienNet
status: public
title: '"Der belgische Symbolismus - Interview mit dem Direktor der Alten Nationalgalerie,
Dr. Ralph Gleis" (PODCAST)'
type: misc
user_id: '78579'
year: '2021'
...
---
_id: '49752'
author:
- first_name: Yves
full_name: Huybrechts, Yves
id: '78579'
last_name: Huybrechts
orcid: 0009-0009-2166-9794
citation:
ama: Huybrechts Y. “Gebaute Träume - Wohnkultur in Flandern und Wallonien” (VIDEO).
BelgienNet; 2021.
apa: Huybrechts, Y. (2021). “Gebaute Träume - Wohnkultur in Flandern und Wallonien”
(VIDEO). BelgienNet.
bibtex: '@book{Huybrechts_2021, title={“Gebaute Träume - Wohnkultur in Flandern
und Wallonien” (VIDEO)}, publisher={BelgienNet}, author={Huybrechts, Yves}, year={2021}
}'
chicago: Huybrechts, Yves. “Gebaute Träume - Wohnkultur in Flandern und Wallonien”
(VIDEO). BelgienNet, 2021.
ieee: Y. Huybrechts, “Gebaute Träume - Wohnkultur in Flandern und Wallonien”
(VIDEO). BelgienNet, 2021.
mla: Huybrechts, Yves. “Gebaute Träume - Wohnkultur in Flandern und Wallonien”
(VIDEO). BelgienNet, 2021.
short: Y. Huybrechts, “Gebaute Träume - Wohnkultur in Flandern und Wallonien” (VIDEO),
BelgienNet, 2021.
date_created: 2023-12-18T09:43:52Z
date_updated: 2023-12-18T10:08:41Z
department:
- _id: '444'
language:
- iso: fre
main_file_link:
- open_access: '1'
url: https://belgien.net/gebaute-traeume-wohnkultur/
oa: '1'
publication_status: published
publisher: BelgienNet
status: public
title: '"Gebaute Träume - Wohnkultur in Flandern und Wallonien" (VIDEO)'
type: misc
user_id: '78579'
year: '2021'
...
---
_id: '49822'
author:
- first_name: Andrea
full_name: Taschl-Erber, Andrea
id: '94342'
last_name: Taschl-Erber
- first_name: Barbara
full_name: Lumesberger-Loisl, Barbara
last_name: Lumesberger-Loisl
citation:
ama: 'Taschl-Erber A, Lumesberger-Loisl B. Redeverbot für Frauen bei Paulus? Die
Macht der Rezeption. In: Wort-Schatz Bibel. ; 2021:1-20.'
apa: Taschl-Erber, A., & Lumesberger-Loisl, B. (2021). Redeverbot für Frauen
bei Paulus? Die Macht der Rezeption. In Wort-Schatz Bibel (pp. 1–20).
bibtex: '@inbook{Taschl-Erber_Lumesberger-Loisl_2021, title={Redeverbot für Frauen
bei Paulus? Die Macht der Rezeption}, booktitle={Wort-Schatz Bibel}, author={Taschl-Erber,
Andrea and Lumesberger-Loisl, Barbara}, year={2021}, pages={1–20} }'
chicago: Taschl-Erber, Andrea, and Barbara Lumesberger-Loisl. “Redeverbot Für Frauen
Bei Paulus? Die Macht Der Rezeption.” In Wort-Schatz Bibel, 1–20, 2021.
ieee: A. Taschl-Erber and B. Lumesberger-Loisl, “Redeverbot für Frauen bei Paulus?
Die Macht der Rezeption,” in Wort-Schatz Bibel, 2021, pp. 1–20.
mla: Taschl-Erber, Andrea, and Barbara Lumesberger-Loisl. “Redeverbot Für Frauen
Bei Paulus? Die Macht Der Rezeption.” Wort-Schatz Bibel, 2021, pp. 1–20.
short: 'A. Taschl-Erber, B. Lumesberger-Loisl, in: Wort-Schatz Bibel, 2021, pp.
1–20.'
date_created: 2023-12-18T17:33:05Z
date_updated: 2023-12-18T17:36:24Z
language:
- iso: eng
main_file_link:
- url: ' https://library-publishing.uni-graz.at/index.php/lp/catalog/series/WortschatzBibel'
page: 1-20
publication: Wort-Schatz Bibel
status: public
title: Redeverbot für Frauen bei Paulus? Die Macht der Rezeption
type: book_chapter
user_id: '70423'
year: '2021'
...