---
_id: '17994'
abstract:
- lang: eng
text: In this work we review the novel framework for the computation of finite dimensional
invariant sets of infinite dimensional dynamical systems developed in [6] and
[36]. By utilizing results on embedding techniques for infinite dimensional systems
we extend a classical subdivision scheme [8] as well as a continuation algorithm
[7] for the computation of attractors and invariant manifolds of finite dimensional
systems to the infinite dimensional case. We show how to implement this approach
for the analysis of delay differential equations and partial differential equations
and illustrate the feasibility of our implementation by computing the attractor
of the Mackey-Glass equation and the unstable manifold of the one-dimensional
Kuramoto-Sivashinsky equation.
author:
- first_name: Raphael
full_name: Gerlach, Raphael
id: '32655'
last_name: Gerlach
- first_name: Adrian
full_name: Ziessler, Adrian
last_name: Ziessler
citation:
ama: 'Gerlach R, Ziessler A. The Approximation of Invariant Sets in Infinite Dimensional
Dynamical Systems. In: Junge O, Schütze O, Ober-Blöbaum S, Padberg-Gehle K, eds.
Advances in Dynamics, Optimization and Computation. Vol 304. Studies in
Systems, Decision and Control. Springer International Publishing; 2020:66-85.
doi:10.1007/978-3-030-51264-4_3'
apa: Gerlach, R., & Ziessler, A. (2020). The Approximation of Invariant Sets
in Infinite Dimensional Dynamical Systems. In O. Junge, O. Schütze, S. Ober-Blöbaum,
& K. Padberg-Gehle (Eds.), Advances in Dynamics, Optimization and Computation
(Vol. 304, pp. 66–85). Springer International Publishing. https://doi.org/10.1007/978-3-030-51264-4_3
bibtex: '@inbook{Gerlach_Ziessler_2020, place={Cham}, series={Studies in Systems,
Decision and Control}, title={The Approximation of Invariant Sets in Infinite
Dimensional Dynamical Systems}, volume={304}, DOI={10.1007/978-3-030-51264-4_3},
booktitle={Advances in Dynamics, Optimization and Computation}, publisher={Springer
International Publishing}, author={Gerlach, Raphael and Ziessler, Adrian}, editor={Junge,
Oliver and Schütze, Oliver and Ober-Blöbaum, Sina and Padberg-Gehle, Kathrin},
year={2020}, pages={66–85}, collection={Studies in Systems, Decision and Control}
}'
chicago: 'Gerlach, Raphael, and Adrian Ziessler. “The Approximation of Invariant
Sets in Infinite Dimensional Dynamical Systems.” In Advances in Dynamics, Optimization
and Computation, edited by Oliver Junge, Oliver Schütze, Sina Ober-Blöbaum,
and Kathrin Padberg-Gehle, 304:66–85. Studies in Systems, Decision and Control.
Cham: Springer International Publishing, 2020. https://doi.org/10.1007/978-3-030-51264-4_3.'
ieee: 'R. Gerlach and A. Ziessler, “The Approximation of Invariant Sets in Infinite
Dimensional Dynamical Systems,” in Advances in Dynamics, Optimization and Computation,
vol. 304, O. Junge, O. Schütze, S. Ober-Blöbaum, and K. Padberg-Gehle, Eds. Cham:
Springer International Publishing, 2020, pp. 66–85.'
mla: Gerlach, Raphael, and Adrian Ziessler. “The Approximation of Invariant Sets
in Infinite Dimensional Dynamical Systems.” Advances in Dynamics, Optimization
and Computation, edited by Oliver Junge et al., vol. 304, Springer International
Publishing, 2020, pp. 66–85, doi:10.1007/978-3-030-51264-4_3.
short: 'R. Gerlach, A. Ziessler, in: O. Junge, O. Schütze, S. Ober-Blöbaum, K. Padberg-Gehle
(Eds.), Advances in Dynamics, Optimization and Computation, Springer International
Publishing, Cham, 2020, pp. 66–85.'
date_created: 2020-08-14T15:02:22Z
date_updated: 2023-11-17T13:13:25Z
department:
- _id: '101'
doi: 10.1007/978-3-030-51264-4_3
editor:
- first_name: Oliver
full_name: Junge, Oliver
last_name: Junge
- first_name: Oliver
full_name: Schütze, Oliver
last_name: Schütze
- first_name: Sina
full_name: Ober-Blöbaum, Sina
last_name: Ober-Blöbaum
- first_name: Kathrin
full_name: Padberg-Gehle, Kathrin
last_name: Padberg-Gehle
intvolume: ' 304'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/978-3-030-51264-4_3
page: 66-85
place: Cham
publication: Advances in Dynamics, Optimization and Computation
publication_identifier:
isbn:
- '9783030512637'
- '9783030512644'
issn:
- 2198-4182
- 2198-4190
publication_status: published
publisher: Springer International Publishing
series_title: Studies in Systems, Decision and Control
status: public
title: The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems
type: book_chapter
user_id: '32655'
volume: 304
year: '2020'
...
---
_id: '48847'
abstract:
- lang: eng
text: Dynamic optimization problems have gained significant attention in evolutionary
computation as evolutionary algorithms (EAs) can easily adapt to changing environments.
We show that EAs can solve the graph coloring problem for bipartite graphs more
efficiently by using dynamic optimization. In our approach the graph instance
is given incrementally such that the EA can reoptimize its coloring when a new
edge introduces a conflict. We show that, when edges are inserted in a way that
preserves graph connectivity, Randomized Local Search (RLS) efficiently finds
a proper 2-coloring for all bipartite graphs. This includes graphs for which RLS
and other EAs need exponential expected time in a static optimization scenario.
We investigate different ways of building up the graph by popular graph traversals
such as breadth-first-search and depth-first-search and analyse the resulting
runtime behavior. We further show that offspring populations (e. g. a (1 + {$\lambda$})
RLS) lead to an exponential speedup in {$\lambda$}. Finally, an island model using
3 islands succeeds in an optimal time of {$\Theta$}(m) on every m-edge bipartite
graph, outperforming offspring populations. This is the first example where an
island model guarantees a speedup that is not bounded in the number of islands.
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. More Effective Randomized Search Heuristics
for Graph Coloring through Dynamic Optimization. In: Proceedings of the Genetic
and Evolutionary Computation Conference. GECCO ’20. Association for Computing
Machinery; 2020:1277–1285. doi:10.1145/3377930.3390174'
apa: Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2020). More Effective
Randomized Search Heuristics for Graph Coloring through Dynamic Optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 1277–1285.
https://doi.org/10.1145/3377930.3390174
bibtex: '@inproceedings{Bossek_Neumann_Peng_Sudholt_2020, place={New York, NY, USA},
series={GECCO ’20}, title={More Effective Randomized Search Heuristics for Graph
Coloring through Dynamic Optimization}, DOI={10.1145/3377930.3390174},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann,
Frank and Peng, Pan and Sudholt, Dirk}, year={2020}, pages={1277–1285}, collection={GECCO
’20} }'
chicago: 'Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “More Effective
Randomized Search Heuristics for Graph Coloring through Dynamic Optimization.”
In Proceedings of the Genetic and Evolutionary Computation Conference,
1277–1285. GECCO ’20. New York, NY, USA: Association for Computing Machinery,
2020. https://doi.org/10.1145/3377930.3390174.'
ieee: 'J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “More Effective Randomized
Search Heuristics for Graph Coloring through Dynamic Optimization,” in Proceedings
of the Genetic and Evolutionary Computation Conference, 2020, pp. 1277–1285,
doi: 10.1145/3377930.3390174.'
mla: Bossek, Jakob, et al. “More Effective Randomized Search Heuristics for Graph
Coloring through Dynamic Optimization.” Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, 2020, pp. 1277–1285,
doi:10.1145/3377930.3390174.
short: 'J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic
and Evolutionary Computation Conference, Association for Computing Machinery,
New York, NY, USA, 2020, pp. 1277–1285.'
date_created: 2023-11-14T15:58:53Z
date_updated: 2023-12-13T10:43:41Z
department:
- _id: '819'
doi: 10.1145/3377930.3390174
extern: '1'
keyword:
- dynamic optimization
- evolutionary algorithms
- running time analysis
- theory
language:
- iso: eng
page: 1277–1285
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-7128-5
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’20
status: public
title: More Effective Randomized Search Heuristics for Graph Coloring through Dynamic
Optimization
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48849'
abstract:
- lang: eng
text: One-shot optimization tasks require to determine the set of solution candidates
prior to their evaluation, i.e., without possibility for adaptive sampling. We
consider two variants, classic one-shot optimization (where our aim is to find
at least one solution of high quality) and one-shot regression (where the goal
is to fit a model that resembles the true problem as well as possible). For both
tasks it seems intuitive that well-distributed samples should perform better than
uniform or grid-based samples, since they show a better coverage of the decision
space. In practice, quasi-random designs such as Latin Hypercube Samples and low-discrepancy
point sets are indeed very commonly used designs for one-shot optimization tasks.
We study in this work how well low star discrepancy correlates with performance
in one-shot optimization. Our results confirm an advantage of low-discrepancy
designs, but also indicate the correlation between discrepancy values and overall
performance is rather weak. We then demonstrate that commonly used designs may
be far from optimal. More precisely, we evolve 24 very specific designs that each
achieve good performance on one of our benchmark problems. Interestingly, we find
that these specifically designed samples yield surprisingly good performance across
the whole benchmark set. Our results therefore give strong indication that significant
performance gains over state-of-the-art one-shot sampling techniques are possible,
and that evolutionary algorithms can be an efficient means to evolve these.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Carola
full_name: Doerr, Carola
last_name: Doerr
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Bossek J, Doerr C, Kerschke P, Neumann A, Neumann F. Evolving Sampling Strategies
for One-Shot Optimization Tasks. In: Parallel Problem Solving from Nature (PPSN
XVI). Springer-Verlag; 2020:111–124. doi:10.1007/978-3-030-58112-1_8'
apa: Bossek, J., Doerr, C., Kerschke, P., Neumann, A., & Neumann, F. (2020).
Evolving Sampling Strategies for One-Shot Optimization Tasks. Parallel Problem
Solving from Nature (PPSN XVI), 111–124. https://doi.org/10.1007/978-3-030-58112-1_8
bibtex: '@inproceedings{Bossek_Doerr_Kerschke_Neumann_Neumann_2020, place={Berlin,
Heidelberg}, title={Evolving Sampling Strategies for One-Shot Optimization Tasks},
DOI={10.1007/978-3-030-58112-1_8},
booktitle={Parallel Problem Solving from Nature (PPSN XVI)}, publisher={Springer-Verlag},
author={Bossek, Jakob and Doerr, Carola and Kerschke, Pascal and Neumann, Aneta
and Neumann, Frank}, year={2020}, pages={111–124} }'
chicago: 'Bossek, Jakob, Carola Doerr, Pascal Kerschke, Aneta Neumann, and Frank
Neumann. “Evolving Sampling Strategies for One-Shot Optimization Tasks.” In Parallel
Problem Solving from Nature (PPSN XVI), 111–124. Berlin, Heidelberg: Springer-Verlag,
2020. https://doi.org/10.1007/978-3-030-58112-1_8.'
ieee: 'J. Bossek, C. Doerr, P. Kerschke, A. Neumann, and F. Neumann, “Evolving Sampling
Strategies for One-Shot Optimization Tasks,” in Parallel Problem Solving from
Nature (PPSN XVI), 2020, pp. 111–124, doi: 10.1007/978-3-030-58112-1_8.'
mla: Bossek, Jakob, et al. “Evolving Sampling Strategies for One-Shot Optimization
Tasks.” Parallel Problem Solving from Nature (PPSN XVI), Springer-Verlag,
2020, pp. 111–124, doi:10.1007/978-3-030-58112-1_8.
short: 'J. Bossek, C. Doerr, P. Kerschke, A. Neumann, F. Neumann, in: Parallel Problem
Solving from Nature (PPSN XVI), Springer-Verlag, Berlin, Heidelberg, 2020, pp.
111–124.'
date_created: 2023-11-14T15:58:53Z
date_updated: 2023-12-13T10:43:53Z
department:
- _id: '819'
doi: 10.1007/978-3-030-58112-1_8
extern: '1'
keyword:
- Continuous optimization
- Fully parallel search
- One-shot optimization
- Regression
- Surrogate-assisted optimization
language:
- iso: eng
page: 111–124
place: Berlin, Heidelberg
publication: Parallel Problem Solving from Nature (PPSN XVI)
publication_identifier:
isbn:
- 978-3-030-58111-4
publication_status: published
publisher: Springer-Verlag
status: public
title: Evolving Sampling Strategies for One-Shot Optimization Tasks
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48851'
abstract:
- lang: eng
text: Several important optimization problems in the area of vehicle routing can
be seen as variants of the classical Traveling Salesperson Problem (TSP). In the
area of evolutionary computation, the Traveling Thief Problem (TTP) has gained
increasing interest over the last 5 years. In this paper, we investigate the effect
of weights on such problems, in the sense that the cost of traveling increases
with respect to the weights of nodes already visited during a tour. This provides
abstractions of important TSP variants such as the Traveling Thief Problem and
time dependent TSP variants, and allows to study precisely the increase in difficulty
caused by weight dependence. We provide a 3.59-approximation for this weight dependent
version of TSP with metric distances and bounded positive weights. Furthermore,
we conduct experimental investigations for simple randomized local search with
classical mutation operators and two variants of the state-of-the-art evolutionary
algorithm EAX adapted to the weighted TSP. Our results show the impact of the
node weights on the position of the nodes in the resulting tour.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Katrin
full_name: Casel, Katrin
last_name: Casel
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Bossek J, Casel K, Kerschke P, Neumann F. The Node Weight Dependent Traveling
Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics.
In: Proceedings of the Genetic and Evolutionary Computation Conference.
GECCO ’20. Association for Computing Machinery; 2020:1286–1294. doi:10.1145/3377930.3390243'
apa: 'Bossek, J., Casel, K., Kerschke, P., & Neumann, F. (2020). The Node Weight
Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized
Search Heuristics. Proceedings of the Genetic and Evolutionary Computation
Conference, 1286–1294. https://doi.org/10.1145/3377930.3390243'
bibtex: '@inproceedings{Bossek_Casel_Kerschke_Neumann_2020, place={New York, NY,
USA}, series={GECCO ’20}, title={The Node Weight Dependent Traveling Salesperson
Problem: Approximation Algorithms and Randomized Search Heuristics}, DOI={10.1145/3377930.3390243},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Casel,
Katrin and Kerschke, Pascal and Neumann, Frank}, year={2020}, pages={1286–1294},
collection={GECCO ’20} }'
chicago: 'Bossek, Jakob, Katrin Casel, Pascal Kerschke, and Frank Neumann. “The
Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms
and Randomized Search Heuristics.” In Proceedings of the Genetic and Evolutionary
Computation Conference, 1286–1294. GECCO ’20. New York, NY, USA: Association
for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390243.'
ieee: 'J. Bossek, K. Casel, P. Kerschke, and F. Neumann, “The Node Weight Dependent
Traveling Salesperson Problem: Approximation Algorithms and Randomized Search
Heuristics,” in Proceedings of the Genetic and Evolutionary Computation Conference,
2020, pp. 1286–1294, doi: 10.1145/3377930.3390243.'
mla: 'Bossek, Jakob, et al. “The Node Weight Dependent Traveling Salesperson Problem:
Approximation Algorithms and Randomized Search Heuristics.” Proceedings of
the Genetic and Evolutionary Computation Conference, Association for Computing
Machinery, 2020, pp. 1286–1294, doi:10.1145/3377930.3390243.'
short: 'J. Bossek, K. Casel, P. Kerschke, F. Neumann, in: Proceedings of the Genetic
and Evolutionary Computation Conference, Association for Computing Machinery,
New York, NY, USA, 2020, pp. 1286–1294.'
date_created: 2023-11-14T15:58:53Z
date_updated: 2023-12-13T10:43:33Z
department:
- _id: '819'
doi: 10.1145/3377930.3390243
extern: '1'
keyword:
- dynamic optimization
- evolutionary algorithms
- running time analysis
- theory
language:
- iso: eng
page: 1286–1294
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-7128-5
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’20
status: public
title: 'The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms
and Randomized Search Heuristics'
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48845'
abstract:
- lang: eng
text: In practice, e.g. in delivery and service scenarios, Vehicle-Routing-Problems
(VRPs) often imply repeated decision making on dynamic customer requests. As in
classical VRPs, tours have to be planned short while the number of serviced customers
has to be maximized at the same time resulting in a multi-objective problem. Beyond
that, however, dynamic requests lead to the need for re-planning of not yet realized
tour parts, while already realized tour parts are irreversible. In this paper
we study this type of bi-objective dynamic VRP including sequential decision making
and concurrent realization of decisions. We adopt a recently proposed Dynamic
Evolutionary Multi-Objective Algorithm (DEMOA) for a related VRP problem and extend
it to the more realistic (here considered) scenario of multiple vehicles. We empirically
show that our DEMOA is competitive with a multi-vehicle offline and clairvoyant
variant of the proposed DEMOA as well as with the dynamic single-vehicle approach
proposed earlier.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Christian
full_name: Grimme, Christian
last_name: Grimme
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Bossek J, Grimme C, Trautmann H. Dynamic Bi-Objective Routing of Multiple
Vehicles. In: Proceedings of the Genetic and Evolutionary Computation Conference.
GECCO ’20. Association for Computing Machinery; 2020:166–174. doi:10.1145/3377930.3390146'
apa: Bossek, J., Grimme, C., & Trautmann, H. (2020). Dynamic Bi-Objective Routing
of Multiple Vehicles. Proceedings of the Genetic and Evolutionary Computation
Conference, 166–174. https://doi.org/10.1145/3377930.3390146
bibtex: '@inproceedings{Bossek_Grimme_Trautmann_2020, place={New York, NY, USA},
series={GECCO ’20}, title={Dynamic Bi-Objective Routing of Multiple Vehicles},
DOI={10.1145/3377930.3390146},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme,
Christian and Trautmann, Heike}, year={2020}, pages={166–174}, collection={GECCO
’20} }'
chicago: 'Bossek, Jakob, Christian Grimme, and Heike Trautmann. “Dynamic Bi-Objective
Routing of Multiple Vehicles.” In Proceedings of the Genetic and Evolutionary
Computation Conference, 166–174. GECCO ’20. New York, NY, USA: Association
for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390146.'
ieee: 'J. Bossek, C. Grimme, and H. Trautmann, “Dynamic Bi-Objective Routing of
Multiple Vehicles,” in Proceedings of the Genetic and Evolutionary Computation
Conference, 2020, pp. 166–174, doi: 10.1145/3377930.3390146.'
mla: Bossek, Jakob, et al. “Dynamic Bi-Objective Routing of Multiple Vehicles.”
Proceedings of the Genetic and Evolutionary Computation Conference, Association
for Computing Machinery, 2020, pp. 166–174, doi:10.1145/3377930.3390146.
short: 'J. Bossek, C. Grimme, H. Trautmann, in: Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, New York, NY, USA,
2020, pp. 166–174.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:43:24Z
department:
- _id: '819'
doi: 10.1145/3377930.3390146
extern: '1'
keyword:
- decision making
- dynamic optimization
- evolutionary algorithms
- multi-objective optimization
- vehicle routing
language:
- iso: eng
page: 166–174
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-7128-5
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’20
status: public
title: Dynamic Bi-Objective Routing of Multiple Vehicles
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48844'
abstract:
- lang: eng
text: The Traveling-Salesperson-Problem (TSP) is arguably one of the best-known
NP-hard combinatorial optimization problems. The two sophisticated heuristic solvers
LKH and EAX and respective (restart) variants manage to calculate close-to optimal
or even optimal solutions, also for large instances with several thousand nodes
in reasonable time. In this work we extend existing benchmarking studies by addressing
anytime behaviour of inexact TSP solvers based on empirical runtime distributions
leading to an increased understanding of solver behaviour and the respective relation
to problem hardness. It turns out that performance ranking of solvers is highly
dependent on the focused approximation quality. Insights on intersection points
of performances offer huge potential for the construction of hybridized solvers
depending on instance features. Moreover, instance features tailored to anytime
performance and corresponding performance indicators will highly improve automated
algorithm selection models by including comprehensive information on solver quality.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Bossek J, Kerschke P, Trautmann H. Anytime Behavior of Inexact TSP Solvers
and Perspectives for Automated Algorithm Selection. In: 2020 IEEE Congress
on Evolutionary Computation (CEC). IEEE Press; 2020:1–8. doi:10.1109/CEC48606.2020.9185613'
apa: Bossek, J., Kerschke, P., & Trautmann, H. (2020). Anytime Behavior of Inexact
TSP Solvers and Perspectives for Automated Algorithm Selection. 2020 IEEE Congress
on Evolutionary Computation (CEC), 1–8. https://doi.org/10.1109/CEC48606.2020.9185613
bibtex: '@inproceedings{Bossek_Kerschke_Trautmann_2020, place={Glasgow, United Kingdom},
title={Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated
Algorithm Selection}, DOI={10.1109/CEC48606.2020.9185613},
booktitle={2020 IEEE Congress on Evolutionary Computation (CEC)}, publisher={IEEE
Press}, author={Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2020},
pages={1–8} }'
chicago: 'Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “Anytime Behavior
of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection.” In
2020 IEEE Congress on Evolutionary Computation (CEC), 1–8. Glasgow, United
Kingdom: IEEE Press, 2020. https://doi.org/10.1109/CEC48606.2020.9185613.'
ieee: 'J. Bossek, P. Kerschke, and H. Trautmann, “Anytime Behavior of Inexact TSP
Solvers and Perspectives for Automated Algorithm Selection,” in 2020 IEEE Congress
on Evolutionary Computation (CEC), 2020, pp. 1–8, doi: 10.1109/CEC48606.2020.9185613.'
mla: Bossek, Jakob, et al. “Anytime Behavior of Inexact TSP Solvers and Perspectives
for Automated Algorithm Selection.” 2020 IEEE Congress on Evolutionary Computation
(CEC), IEEE Press, 2020, pp. 1–8, doi:10.1109/CEC48606.2020.9185613.
short: 'J. Bossek, P. Kerschke, H. Trautmann, in: 2020 IEEE Congress on Evolutionary
Computation (CEC), IEEE Press, Glasgow, United Kingdom, 2020, pp. 1–8.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:43:16Z
department:
- _id: '819'
doi: 10.1109/CEC48606.2020.9185613
extern: '1'
language:
- iso: eng
page: 1–8
place: Glasgow, United Kingdom
publication: 2020 IEEE Congress on Evolutionary Computation (CEC)
publication_status: published
publisher: IEEE Press
status: public
title: Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm
Selection
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48850'
abstract:
- lang: eng
text: Sequential model-based optimization (SMBO) approaches are algorithms for solving
problems that require computationally or otherwise expensive function evaluations.
The key design principle of SMBO is a substitution of the true objective function
by a surrogate, which is used to propose the point(s) to be evaluated next. SMBO
algorithms are intrinsically modular, leaving the user with many important design
choices. Significant research efforts go into understanding which settings perform
best for which type of problems. Most works, however, focus on the choice of the
model, the acquisition function, and the strategy used to optimize the latter.
The choice of the initial sampling strategy, however, receives much less attention.
Not surprisingly, quite diverging recommendations can be found in the literature.
We analyze in this work how the size and the distribution of the initial sample
influences the overall quality of the efficient global optimization (EGO) algorithm,
a well-known SMBO approach. While, overall, small initial budgets using Halton
sampling seem preferable, we also observe that the performance landscape is rather
unstructured. We furthermore identify several situations in which EGO performs
unfavorably against random sampling. Both observations indicate that an adaptive
SMBO design could be beneficial, making SMBO an interesting test-bed for automated
algorithm design.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Carola
full_name: Doerr, Carola
last_name: Doerr
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
citation:
ama: 'Bossek J, Doerr C, Kerschke P. Initial Design Strategies and Their Effects
on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB.
In: Proceedings of the Genetic and Evolutionary Computation Conference.
GECCO ’20. Association for Computing Machinery; 2020:778–786. doi:10.1145/3377930.3390155'
apa: 'Bossek, J., Doerr, C., & Kerschke, P. (2020). Initial Design Strategies
and Their Effects on Sequential Model-Based Optimization: An Exploratory Case
Study Based on BBOB. Proceedings of the Genetic and Evolutionary Computation
Conference, 778–786. https://doi.org/10.1145/3377930.3390155'
bibtex: '@inproceedings{Bossek_Doerr_Kerschke_2020, place={New York, NY, USA}, series={GECCO
’20}, title={Initial Design Strategies and Their Effects on Sequential Model-Based
Optimization: An Exploratory Case Study Based on BBOB}, DOI={10.1145/3377930.3390155},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Doerr,
Carola and Kerschke, Pascal}, year={2020}, pages={778–786}, collection={GECCO
’20} }'
chicago: 'Bossek, Jakob, Carola Doerr, and Pascal Kerschke. “Initial Design Strategies
and Their Effects on Sequential Model-Based Optimization: An Exploratory Case
Study Based on BBOB.” In Proceedings of the Genetic and Evolutionary Computation
Conference, 778–786. GECCO ’20. New York, NY, USA: Association for Computing
Machinery, 2020. https://doi.org/10.1145/3377930.3390155.'
ieee: 'J. Bossek, C. Doerr, and P. Kerschke, “Initial Design Strategies and Their
Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based
on BBOB,” in Proceedings of the Genetic and Evolutionary Computation Conference,
2020, pp. 778–786, doi: 10.1145/3377930.3390155.'
mla: 'Bossek, Jakob, et al. “Initial Design Strategies and Their Effects on Sequential
Model-Based Optimization: An Exploratory Case Study Based on BBOB.” Proceedings
of the Genetic and Evolutionary Computation Conference, Association for Computing
Machinery, 2020, pp. 778–786, doi:10.1145/3377930.3390155.'
short: 'J. Bossek, C. Doerr, P. Kerschke, in: Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, New York, NY, USA,
2020, pp. 778–786.'
date_created: 2023-11-14T15:58:53Z
date_updated: 2023-12-13T10:44:01Z
department:
- _id: '819'
doi: 10.1145/3377930.3390155
extern: '1'
keyword:
- continuous black-box optimization
- design of experiments
- initial design
- sequential model-based optimization
language:
- iso: eng
page: 778–786
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-7128-5
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’20
status: public
title: 'Initial Design Strategies and Their Effects on Sequential Model-Based Optimization:
An Exploratory Case Study Based on BBOB'
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48895'
abstract:
- lang: eng
text: Evolutionary algorithms (EAs) are general-purpose problem solvers that usually
perform an unbiased search. This is reasonable and desirable in a black-box scenario.
For combinatorial optimization problems, often more knowledge about the structure
of optimal solutions is given, which can be leveraged by means of biased search
operators. We consider the Minimum Spanning Tree (MST) problem in a single- and
multi-objective version, and introduce a biased mutation, which puts more emphasis
on the selection of edges of low rank in terms of low domination number. We present
example graphs where the biased mutation can significantly speed up the expected
runtime until (Pareto-)optimal solutions are found. On the other hand, we demonstrate
that bias can lead to exponential runtime if "heavy" edges are necessarily part
of an optimal solution. However, on general graphs in the single-objective setting,
we show that a combined mutation operator which decides for unbiased or biased
edge selection in each step with equal probability exhibits a polynomial upper
bound - as unbiased mutation - in the worst case and benefits from bias if the
circumstances are favorable.
author:
- first_name: Vahid
full_name: Roostapour, Vahid
last_name: Roostapour
- 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: 'Roostapour V, Bossek J, Neumann F. Runtime Analysis of Evolutionary Algorithms
with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem. In:
Proceedings of the 2020 Genetic and Evolutionary Computation Conference.
{GECCO} ’20. Association for Computing Machinery; 2020:551–559. doi:10.1145/3377930.3390168'
apa: Roostapour, V., Bossek, J., & Neumann, F. (2020). Runtime Analysis of Evolutionary
Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree
Problem. Proceedings of the 2020 Genetic and Evolutionary Computation Conference,
551–559. https://doi.org/10.1145/3377930.3390168
bibtex: '@inproceedings{Roostapour_Bossek_Neumann_2020, place={New York, NY, USA},
series={{GECCO} ’20}, title={Runtime Analysis of Evolutionary Algorithms with
Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem}, DOI={10.1145/3377930.3390168}, booktitle={Proceedings
of the 2020 Genetic and Evolutionary Computation Conference}, publisher={Association
for Computing Machinery}, author={Roostapour, Vahid and Bossek, Jakob and Neumann,
Frank}, year={2020}, pages={551–559}, collection={{GECCO} ’20} }'
chicago: 'Roostapour, Vahid, Jakob Bossek, and Frank Neumann. “Runtime Analysis
of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum
Spanning Tree Problem.” In Proceedings of the 2020 Genetic and Evolutionary
Computation Conference, 551–559. {GECCO} ’20. New York, NY, USA: Association
for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390168.'
ieee: 'V. Roostapour, J. Bossek, and F. Neumann, “Runtime Analysis of Evolutionary
Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree
Problem,” in Proceedings of the 2020 Genetic and Evolutionary Computation Conference,
2020, pp. 551–559, doi: 10.1145/3377930.3390168.'
mla: Roostapour, Vahid, et al. “Runtime Analysis of Evolutionary Algorithms with
Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem.” Proceedings
of the 2020 Genetic and Evolutionary Computation Conference, Association for
Computing Machinery, 2020, pp. 551–559, doi:10.1145/3377930.3390168.
short: 'V. Roostapour, J. Bossek, F. Neumann, in: Proceedings of the 2020 Genetic
and Evolutionary Computation Conference, Association for Computing Machinery,
New York, NY, USA, 2020, pp. 551–559.'
date_created: 2023-11-14T15:59:00Z
date_updated: 2023-12-13T10:49:38Z
department:
- _id: '819'
doi: 10.1145/3377930.3390168
extern: '1'
keyword:
- biased mutation
- evolutionary algorithms
- minimum spanning tree problem
- runtime analysis
language:
- iso: eng
page: 551–559
place: New York, NY, USA
publication: Proceedings of the 2020 Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-7128-5
publisher: Association for Computing Machinery
series_title: '{GECCO} ’20'
status: public
title: Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective
Minimum Spanning Tree Problem
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48848'
abstract:
- lang: eng
text: We build upon a recently proposed multi-objective view onto performance measurement
of single-objective stochastic solvers. The trade-off between the fraction of
failed runs and the mean runtime of successful runs \textendash both to be minimized
\textendash is directly analyzed based on a study on algorithm selection of inexact
state-of-the-art solvers for the famous Traveling Salesperson Problem (TSP). Moreover,
we adopt the hypervolume indicator (HV) commonly used in multi-objective optimization
for simultaneously assessing both conflicting objectives and investigate relations
to commonly used performance indicators, both theoretically and empirically. Next
to Penalized Average Runtime (PAR) and Penalized Quantile Runtime (PQR), the HV
measure is used as a core concept within the construction of per-instance algorithm
selection models offering interesting insights into complementary behavior of
inexact TSP solvers. \textbullet The multi-objective perspective is naturally
generalizable to multiple objectives. \textbullet Proof of relationship between
HV and the PAR in the considered bi-objective space. \textbullet New insights
into complementary behavior of stochastic optimization algorithms.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: Bossek J, Kerschke P, Trautmann H. A Multi-Objective Perspective on Performance
Assessment and Automated Selection of Single-Objective Optimization Algorithms.
Applied Soft Computing. 2020;88(C). doi:10.1016/j.asoc.2019.105901
apa: Bossek, J., Kerschke, P., & Trautmann, H. (2020). A Multi-Objective Perspective
on Performance Assessment and Automated Selection of Single-Objective Optimization
Algorithms. Applied Soft Computing, 88(C). https://doi.org/10.1016/j.asoc.2019.105901
bibtex: '@article{Bossek_Kerschke_Trautmann_2020, title={A Multi-Objective Perspective
on Performance Assessment and Automated Selection of Single-Objective Optimization
Algorithms}, volume={88}, DOI={10.1016/j.asoc.2019.105901},
number={C}, journal={Applied Soft Computing}, author={Bossek, Jakob and Kerschke,
Pascal and Trautmann, Heike}, year={2020} }'
chicago: Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “A Multi-Objective
Perspective on Performance Assessment and Automated Selection of Single-Objective
Optimization Algorithms.” Applied Soft Computing 88, no. C (2020). https://doi.org/10.1016/j.asoc.2019.105901.
ieee: 'J. Bossek, P. Kerschke, and H. Trautmann, “A Multi-Objective Perspective
on Performance Assessment and Automated Selection of Single-Objective Optimization
Algorithms,” Applied Soft Computing, vol. 88, no. C, 2020, doi: 10.1016/j.asoc.2019.105901.'
mla: Bossek, Jakob, et al. “A Multi-Objective Perspective on Performance Assessment
and Automated Selection of Single-Objective Optimization Algorithms.” Applied
Soft Computing, vol. 88, no. C, 2020, doi:10.1016/j.asoc.2019.105901.
short: J. Bossek, P. Kerschke, H. Trautmann, Applied Soft Computing 88 (2020).
date_created: 2023-11-14T15:58:53Z
date_updated: 2023-12-13T10:52:17Z
department:
- _id: '819'
doi: 10.1016/j.asoc.2019.105901
intvolume: ' 88'
issue: C
keyword:
- Algorithm selection
- Combinatorial optimization
- Multi-objective optimization
- Performance measurement
- Traveling Salesperson Problem
language:
- iso: eng
publication: Applied Soft Computing
publication_identifier:
issn:
- 1568-4946
status: public
title: A Multi-Objective Perspective on Performance Assessment and Automated Selection
of Single-Objective Optimization Algorithms
type: journal_article
user_id: '102979'
volume: 88
year: '2020'
...
---
_id: '48836'
author:
- first_name: Thomas
full_name: Bartz-Beielstein, Thomas
last_name: Bartz-Beielstein
- first_name: Carola
full_name: Doerr, Carola
last_name: Doerr
- first_name: Daan
full_name: van den Berg, Daan
last_name: van den Berg
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Sowmya
full_name: Chandrasekaran, Sowmya
last_name: Chandrasekaran
- first_name: Tome
full_name: Eftimov, Tome
last_name: Eftimov
- first_name: Andreas
full_name: Fischbach, Andreas
last_name: Fischbach
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: William La
full_name: Cava, William La
last_name: Cava
- first_name: Manuel
full_name: Lopez-Ibanez, Manuel
last_name: Lopez-Ibanez
- first_name: Katherine M.
full_name: Malan, Katherine M.
last_name: Malan
- first_name: Jason H.
full_name: Moore, Jason H.
last_name: Moore
- first_name: Boris
full_name: Naujoks, Boris
last_name: Naujoks
- first_name: Patryk
full_name: Orzechowski, Patryk
last_name: Orzechowski
- first_name: Vanessa
full_name: Volz, Vanessa
last_name: Volz
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
- first_name: Thomas
full_name: Weise, Thomas
last_name: Weise
citation:
ama: 'Bartz-Beielstein T, Doerr C, van den Berg D, et al. Benchmarking in Optimization:
Best Practice and Open Issues. Corr. Published online 2020.'
apa: 'Bartz-Beielstein, T., Doerr, C., van den Berg, D., Bossek, J., Chandrasekaran,
S., Eftimov, T., Fischbach, A., Kerschke, P., Cava, W. L., Lopez-Ibanez, M., Malan,
K. M., Moore, J. H., Naujoks, B., Orzechowski, P., Volz, V., Wagner, M., &
Weise, T. (2020). Benchmarking in Optimization: Best Practice and Open Issues.
Corr.'
bibtex: '@article{Bartz-Beielstein_Doerr_van den Berg_Bossek_Chandrasekaran_Eftimov_Fischbach_Kerschke_Cava_Lopez-Ibanez_et
al._2020, title={Benchmarking in Optimization: Best Practice and Open Issues},
journal={Corr}, author={Bartz-Beielstein, Thomas and Doerr, Carola and van den
Berg, Daan and Bossek, Jakob and Chandrasekaran, Sowmya and Eftimov, Tome and
Fischbach, Andreas and Kerschke, Pascal and Cava, William La and Lopez-Ibanez,
Manuel and et al.}, year={2020} }'
chicago: 'Bartz-Beielstein, Thomas, Carola Doerr, Daan van den Berg, Jakob Bossek,
Sowmya Chandrasekaran, Tome Eftimov, Andreas Fischbach, et al. “Benchmarking in
Optimization: Best Practice and Open Issues.” Corr, 2020.'
ieee: 'T. Bartz-Beielstein et al., “Benchmarking in Optimization: Best Practice
and Open Issues,” Corr, 2020.'
mla: 'Bartz-Beielstein, Thomas, et al. “Benchmarking in Optimization: Best Practice
and Open Issues.” Corr, 2020.'
short: T. Bartz-Beielstein, C. Doerr, D. van den Berg, J. Bossek, S. Chandrasekaran,
T. Eftimov, A. Fischbach, P. Kerschke, W.L. Cava, M. Lopez-Ibanez, K.M. Malan,
J.H. Moore, B. Naujoks, P. Orzechowski, V. Volz, M. Wagner, T. Weise, Corr (2020).
date_created: 2023-11-14T15:58:51Z
date_updated: 2023-12-13T10:52:24Z
department:
- _id: '819'
language:
- iso: eng
publication: Corr
status: public
title: 'Benchmarking in Optimization: Best Practice and Open Issues'
type: journal_article
user_id: '102979'
year: '2020'
...
---
_id: '47476'
abstract:
- lang: eng
text: "Digital data on tangible and intangible cultural assets is an essential part
of daily life, communication and experience. It has a lasting influence on the
perception of cultural identity as well as on the interactions between research,
the cultural economy and society. Throughout the last three decades, many cultural
heritage institutions have contributed a wealth of digital representations of
cultural assets (2D digital reproductions of paintings, sheet music, 3D digital
models of sculptures, monuments, rooms, buildings), audio-visual data (music,
film, stage performances), and procedural research data such as encoding and annotation
formats. The long-term preservation and FAIR availability of research data from
the cultural heritage domain is fundamentally important, not only for future academic
success in the humanities but also for the cultural identity of individuals and
society as a whole. Up to now, no coordinated effort for professional research
data management on a national level exists in Germany. NFDI4Culture aims to fill
this gap and create a user-centered, research-driven infrastructure that will
cover a broad range of research domains from musicology, art history and architecture
to performance, theatre, film, and media studies.\r\n The
research landscape addressed by the consortium is characterized by strong institutional
differentiation. Research units in the consortium's community of interest comprise
university institutes, art colleges, academies, galleries, libraries, archives
and museums. This diverse landscape is also characterized by an abundance of research
objects, methodologies and a great potential for data-driven research. In a unique
effort carried out by the applicant and co-applicants of this proposal and ten
academic societies, this community is interconnected for the first time through
a federated approach that is ideally suited to the needs of the participating
researchers. To promote collaboration within the NFDI, to share knowledge and
technology and to provide extensive support for its users have been the guiding
principles of the consortium from the beginning and will be at the heart of all
workflows and decision-making processes. Thanks to these principles, NFDI4Culture
has gathered strong support ranging from individual researchers to high-level
cultural heritage organizations such as the UNESCO, the International Council
of Museums, the Open Knowledge Foundation and Wikimedia. On this basis, NFDI4Culture
will take innovative measures that promote a cultural change towards a more reflective
and sustainable handling of research data and at the same time boost qualification
and professionalization in data-driven research in the domain of cultural heritage.
This will create a long-lasting impact on science, cultural economy and society
as a whole."
article_type: original
author:
- first_name: Reinhard
full_name: Altenhöner, Reinhard
last_name: Altenhöner
- first_name: Ina
full_name: Blümel, Ina
last_name: Blümel
- first_name: Franziska
full_name: Boehm, Franziska
last_name: Boehm
- first_name: Jens
full_name: Bove, Jens
last_name: Bove
- first_name: Katrin
full_name: Bicher, Katrin
last_name: Bicher
- first_name: Christian
full_name: Bracht, Christian
last_name: Bracht
- first_name: Ortrun
full_name: Brand, Ortrun
last_name: Brand
- first_name: Lisa
full_name: Dieckmann, Lisa
last_name: Dieckmann
- first_name: Maria
full_name: Effinger, Maria
last_name: Effinger
- first_name: Malte
full_name: Hagener, Malte
last_name: Hagener
- first_name: Andrea
full_name: Hammes, Andrea
last_name: Hammes
- first_name: Lambert
full_name: Heller, Lambert
last_name: Heller
- first_name: Angela
full_name: Kailus, Angela
last_name: Kailus
- first_name: Hubertus
full_name: Kohle, Hubertus
last_name: Kohle
- first_name: Jens
full_name: Ludwig, Jens
last_name: Ludwig
- first_name: Andreas
full_name: Münzmay, Andreas
id: '61139'
last_name: Münzmay
orcid: 0000-0002-8373-4055
- first_name: Sarah
full_name: Pittroff, Sarah
last_name: Pittroff
- first_name: Matthias
full_name: Razum, Matthias
last_name: Razum
- first_name: Daniel
full_name: Röwenstrunk, Daniel
last_name: Röwenstrunk
- first_name: Harald
full_name: Sack, Harald
last_name: Sack
- first_name: Holger
full_name: Simon, Holger
last_name: Simon
- first_name: Dörte
full_name: Schmidt, Dörte
last_name: Schmidt
- first_name: Torsten
full_name: Schrade, Torsten
last_name: Schrade
- first_name: Annika-Valeska
full_name: Walzel, Annika-Valeska
last_name: Walzel
- first_name: Barbara
full_name: Wiermann, Barbara
last_name: Wiermann
citation:
ama: Altenhöner R, Blümel I, Boehm F, et al. NFDI4Culture - Consortium for research
data on material and immaterial cultural heritage. Research Ideas and Outcomes.
2020;6. doi:10.3897/rio.6.e57036
apa: Altenhöner, R., Blümel, I., Boehm, F., Bove, J., Bicher, K., Bracht, C., Brand,
O., Dieckmann, L., Effinger, M., Hagener, M., Hammes, A., Heller, L., Kailus,
A., Kohle, H., Ludwig, J., Münzmay, A., Pittroff, S., Razum, M., Röwenstrunk,
D., … Wiermann, B. (2020). NFDI4Culture - Consortium for research data on material
and immaterial cultural heritage. Research Ideas and Outcomes, 6.
https://doi.org/10.3897/rio.6.e57036
bibtex: '@article{Altenhöner_Blümel_Boehm_Bove_Bicher_Bracht_Brand_Dieckmann_Effinger_Hagener_et
al._2020, title={NFDI4Culture - Consortium for research data on material and immaterial
cultural heritage}, volume={6}, DOI={10.3897/rio.6.e57036},
journal={Research Ideas and Outcomes}, publisher={Pensoft Publishers}, author={Altenhöner,
Reinhard and Blümel, Ina and Boehm, Franziska and Bove, Jens and Bicher, Katrin
and Bracht, Christian and Brand, Ortrun and Dieckmann, Lisa and Effinger, Maria
and Hagener, Malte and et al.}, year={2020} }'
chicago: Altenhöner, Reinhard, Ina Blümel, Franziska Boehm, Jens Bove, Katrin Bicher,
Christian Bracht, Ortrun Brand, et al. “NFDI4Culture - Consortium for Research
Data on Material and Immaterial Cultural Heritage.” Research Ideas and Outcomes
6 (2020). https://doi.org/10.3897/rio.6.e57036.
ieee: 'R. Altenhöner et al., “NFDI4Culture - Consortium for research data
on material and immaterial cultural heritage,” Research Ideas and Outcomes,
vol. 6, 2020, doi: 10.3897/rio.6.e57036.'
mla: Altenhöner, Reinhard, et al. “NFDI4Culture - Consortium for Research Data on
Material and Immaterial Cultural Heritage.” Research Ideas and Outcomes,
vol. 6, Pensoft Publishers, 2020, doi:10.3897/rio.6.e57036.
short: R. Altenhöner, I. Blümel, F. Boehm, J. Bove, K. Bicher, C. Bracht, O. Brand,
L. Dieckmann, M. Effinger, M. Hagener, A. Hammes, L. Heller, A. Kailus, H. Kohle,
J. Ludwig, A. Münzmay, S. Pittroff, M. Razum, D. Röwenstrunk, H. Sack, H. Simon,
D. Schmidt, T. Schrade, A.-V. Walzel, B. Wiermann, Research Ideas and Outcomes
6 (2020).
date_created: 2023-09-27T07:02:04Z
date_updated: 2024-02-19T11:01:52Z
department:
- _id: '572'
- _id: '856'
- _id: '615'
doi: 10.3897/rio.6.e57036
intvolume: ' 6'
keyword:
- Research Data Management
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.3897/rio.6.e57036
oa: '1'
project:
- _id: '745'
name: 'NFDI4Culture: NFDI4Culture – Konsortium für Forschungsdaten materieller und
immaterieller Kulturgüter'
publication: Research Ideas and Outcomes
publication_identifier:
issn:
- 2367-7163
publication_status: published
publisher: Pensoft Publishers
quality_controlled: '1'
status: public
title: NFDI4Culture - Consortium for research data on material and immaterial cultural
heritage
type: journal_article
user_id: '61139'
volume: 6
year: '2020'
...
---
_id: '51561'
author:
- first_name: Joachim
full_name: Hilgert, Joachim
id: '220'
last_name: Hilgert
citation:
ama: 'Hilgert J. Robert Bosch: OPT ART – From Mathematical Optimization to Visual
Design. Princeton University Press 2019. Mathematische Semesterberichte.
2020;67:123–124. doi:10.1007/s00591-020-00272-6'
apa: 'Hilgert, J. (2020). Robert Bosch: OPT ART – From Mathematical Optimization
to Visual Design. Princeton University Press 2019. In Mathematische Semesterberichte
(Vol. 67, pp. 123–124). https://doi.org/10.1007/s00591-020-00272-6'
bibtex: '@article{Hilgert_2020, title={Robert Bosch: OPT ART – From Mathematical
Optimization to Visual Design. Princeton University Press 2019}, volume={67},
DOI={10.1007/s00591-020-00272-6},
journal={Mathematische Semesterberichte}, author={Hilgert, Joachim}, year={2020},
pages={123–124} }'
chicago: 'Hilgert, Joachim. “Robert Bosch: OPT ART – From Mathematical Optimization
to Visual Design. Princeton University Press 2019.” Mathematische Semesterberichte,
2020. https://doi.org/10.1007/s00591-020-00272-6.'
ieee: 'J. Hilgert, “Robert Bosch: OPT ART – From Mathematical Optimization to Visual
Design. Princeton University Press 2019,” Mathematische Semesterberichte,
vol. 67. pp. 123–124, 2020, doi: 10.1007/s00591-020-00272-6.'
mla: 'Hilgert, Joachim. “Robert Bosch: OPT ART – From Mathematical Optimization
to Visual Design. Princeton University Press 2019.” Mathematische Semesterberichte,
vol. 67, 2020, pp. 123–124, doi:10.1007/s00591-020-00272-6.'
short: J. Hilgert, Mathematische Semesterberichte 67 (2020) 123–124.
date_created: 2024-02-20T10:03:14Z
date_updated: 2024-02-20T10:04:02Z
department:
- _id: '91'
doi: 10.1007/s00591-020-00272-6
intvolume: ' 67'
language:
- iso: eng
page: 123–124
publication: Mathematische Semesterberichte
publication_status: published
status: public
title: 'Robert Bosch: OPT ART – From Mathematical Optimization to Visual Design. Princeton
University Press 2019'
type: review
user_id: '49063'
volume: 67
year: '2020'
...
---
_id: '53889'
author:
- first_name: Hiwa
full_name: Farughi, Hiwa
last_name: Farughi
- first_name: Madjid
full_name: Tavana, Madjid
id: '31858'
last_name: Tavana
- first_name: Sobhan
full_name: Mostafayi, Sobhan
last_name: Mostafayi
- first_name: Francisco J.
full_name: Santos Arteaga, Francisco J.
last_name: Santos Arteaga
citation:
ama: Farughi H, Tavana M, Mostafayi S, Santos Arteaga FJ. A novel optimization model
for designing compact, balanced, and contiguous healthcare districts. Journal
of the Operational Research Society. 2020;71(11):1740-1759. doi:10.1080/01605682.2019.1621217
apa: Farughi, H., Tavana, M., Mostafayi, S., & Santos Arteaga, F. J. (2020).
A novel optimization model for designing compact, balanced, and contiguous healthcare
districts. Journal of the Operational Research Society, 71(11),
1740–1759. https://doi.org/10.1080/01605682.2019.1621217
bibtex: '@article{Farughi_Tavana_Mostafayi_Santos Arteaga_2020, title={A novel optimization
model for designing compact, balanced, and contiguous healthcare districts}, volume={71},
DOI={10.1080/01605682.2019.1621217},
number={11}, journal={Journal of the Operational Research Society}, publisher={Informa
UK Limited}, author={Farughi, Hiwa and Tavana, Madjid and Mostafayi, Sobhan and
Santos Arteaga, Francisco J.}, year={2020}, pages={1740–1759} }'
chicago: 'Farughi, Hiwa, Madjid Tavana, Sobhan Mostafayi, and Francisco J. Santos
Arteaga. “A Novel Optimization Model for Designing Compact, Balanced, and Contiguous
Healthcare Districts.” Journal of the Operational Research Society 71,
no. 11 (2020): 1740–59. https://doi.org/10.1080/01605682.2019.1621217.'
ieee: 'H. Farughi, M. Tavana, S. Mostafayi, and F. J. Santos Arteaga, “A novel optimization
model for designing compact, balanced, and contiguous healthcare districts,” Journal
of the Operational Research Society, vol. 71, no. 11, pp. 1740–1759, 2020,
doi: 10.1080/01605682.2019.1621217.'
mla: Farughi, Hiwa, et al. “A Novel Optimization Model for Designing Compact, Balanced,
and Contiguous Healthcare Districts.” Journal of the Operational Research Society,
vol. 71, no. 11, Informa UK Limited, 2020, pp. 1740–59, doi:10.1080/01605682.2019.1621217.
short: H. Farughi, M. Tavana, S. Mostafayi, F.J. Santos Arteaga, Journal of the
Operational Research Society 71 (2020) 1740–1759.
date_created: 2024-05-04T15:37:17Z
date_updated: 2024-05-04T15:57:32Z
department:
- _id: '277'
doi: 10.1080/01605682.2019.1621217
intvolume: ' 71'
issue: '11'
language:
- iso: eng
page: 1740-1759
publication: Journal of the Operational Research Society
publication_identifier:
issn:
- 0160-5682
- 1476-9360
publication_status: published
publisher: Informa UK Limited
status: public
title: A novel optimization model for designing compact, balanced, and contiguous
healthcare districts
type: journal_article
user_id: '51811'
volume: 71
year: '2020'
...
---
_id: '46334'
abstract:
- lang: eng
text: We build upon a recently proposed multi-objective view onto performance measurement
of single-objective stochastic solvers. The trade-off between the fraction of
failed runs and the mean runtime of successful runs – both to be minimized – is
directly analyzed based on a study on algorithm selection of inexact state-of-the-art
solvers for the famous Traveling Salesperson Problem (TSP). Moreover, we adopt
the hypervolume indicator (HV) commonly used in multi-objective optimization for
simultaneously assessing both conflicting objectives and investigate relations
to commonly used performance indicators, both theoretically and empirically. Next
to Penalized Average Runtime (PAR) and Penalized Quantile Runtime (PQR), the HV
measure is used as a core concept within the construction of per-instance algorithm
selection models offering interesting insights into complementary behavior of
inexact TSP solvers.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: Bossek J, Kerschke P, Trautmann H. A multi-objective perspective on performance
assessment and automated selection of single-objective optimization algorithms.
Applied Soft Computing. 2020;88:105901. doi:https://doi.org/10.1016/j.asoc.2019.105901
apa: Bossek, J., Kerschke, P., & Trautmann, H. (2020). A multi-objective perspective
on performance assessment and automated selection of single-objective optimization
algorithms. Applied Soft Computing, 88, 105901. https://doi.org/10.1016/j.asoc.2019.105901
bibtex: '@article{Bossek_Kerschke_Trautmann_2020, title={A multi-objective perspective
on performance assessment and automated selection of single-objective optimization
algorithms}, volume={88}, DOI={https://doi.org/10.1016/j.asoc.2019.105901},
journal={Applied Soft Computing}, author={Bossek, Jakob and Kerschke, Pascal and
Trautmann, Heike}, year={2020}, pages={105901} }'
chicago: 'Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “A Multi-Objective
Perspective on Performance Assessment and Automated Selection of Single-Objective
Optimization Algorithms.” Applied Soft Computing 88 (2020): 105901. https://doi.org/10.1016/j.asoc.2019.105901.'
ieee: 'J. Bossek, P. Kerschke, and H. Trautmann, “A multi-objective perspective
on performance assessment and automated selection of single-objective optimization
algorithms,” Applied Soft Computing, vol. 88, p. 105901, 2020, doi: https://doi.org/10.1016/j.asoc.2019.105901.'
mla: Bossek, Jakob, et al. “A Multi-Objective Perspective on Performance Assessment
and Automated Selection of Single-Objective Optimization Algorithms.” Applied
Soft Computing, vol. 88, 2020, p. 105901, doi:https://doi.org/10.1016/j.asoc.2019.105901.
short: J. Bossek, P. Kerschke, H. Trautmann, Applied Soft Computing 88 (2020) 105901.
date_created: 2023-08-04T07:42:26Z
date_updated: 2024-06-10T12:00:46Z
department:
- _id: '34'
- _id: '819'
doi: https://doi.org/10.1016/j.asoc.2019.105901
intvolume: ' 88'
keyword:
- Algorithm selection
- Multi-objective optimization
- Performance measurement
- Combinatorial optimization
- Traveling Salesperson Problem
language:
- iso: eng
page: '105901'
publication: Applied Soft Computing
publication_identifier:
issn:
- 1568-4946
status: public
title: A multi-objective perspective on performance assessment and automated selection
of single-objective optimization algorithms
type: journal_article
user_id: '15504'
volume: 88
year: '2020'
...
---
_id: '46324'
abstract:
- lang: eng
text: The Traveling-Salesperson-Problem (TSP) is arguably one of the best-known
NP-hard combinatorial optimization problems. The two sophisticated heuristic solvers
LKH and EAX and respective (restart) variants manage to calculate close-to optimal
or even optimal solutions, also for large instances with several thousand nodes
in reasonable time. In this work we extend existing benchmarking studies by addressing
anytime behaviour of inexact TSP solvers based on empirical runtime distributions
leading to an increased understanding of solver behaviour and the respective relation
to problem hardness. It turns out that performance ranking of solvers is highly
dependent on the focused approximation quality. Insights on intersection points
of performances offer huge potential for the construction of hybridized solvers
depending on instance features. Moreover, instance features tailored to anytime
performance and corresponding performance indicators will highly improve automated
algorithm selection models by including comprehensive information on solver quality.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Bossek J, Kerschke P, Trautmann H. Anytime Behavior of Inexact TSP Solvers
and Perspectives for Automated Algorithm Selection. In: Proceedings of the
IEEE Congress on Evolutionary Computation (CEC). IEEE; 2020:1–8.'
apa: Bossek, J., Kerschke, P., & Trautmann, H. (2020). Anytime Behavior of Inexact
TSP Solvers and Perspectives for Automated Algorithm Selection. Proceedings
of the IEEE Congress on Evolutionary Computation (CEC), 1–8.
bibtex: '@inproceedings{Bossek_Kerschke_Trautmann_2020, place={Glasgow, UK}, title={Anytime
Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection},
booktitle={Proceedings of the IEEE Congress on Evolutionary Computation (CEC)},
publisher={IEEE}, author={Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike},
year={2020}, pages={1–8} }'
chicago: 'Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “Anytime Behavior
of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection.” In
Proceedings of the IEEE Congress on Evolutionary Computation (CEC), 1–8.
Glasgow, UK: IEEE, 2020.'
ieee: J. Bossek, P. Kerschke, and H. Trautmann, “Anytime Behavior of Inexact TSP
Solvers and Perspectives for Automated Algorithm Selection,” in Proceedings
of the IEEE Congress on Evolutionary Computation (CEC), 2020, pp. 1–8.
mla: Bossek, Jakob, et al. “Anytime Behavior of Inexact TSP Solvers and Perspectives
for Automated Algorithm Selection.” Proceedings of the IEEE Congress on Evolutionary
Computation (CEC), IEEE, 2020, pp. 1–8.
short: 'J. Bossek, P. Kerschke, H. Trautmann, in: Proceedings of the IEEE Congress
on Evolutionary Computation (CEC), IEEE, Glasgow, UK, 2020, pp. 1–8.'
date_created: 2023-08-04T07:34:40Z
date_updated: 2024-06-10T12:01:46Z
department:
- _id: '34'
- _id: '819'
language:
- iso: eng
page: 1–8
place: Glasgow, UK
publication: Proceedings of the IEEE Congress on Evolutionary Computation (CEC)
publisher: IEEE
status: public
title: Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm
Selection
type: conference
user_id: '15504'
year: '2020'
...
---
_id: '33866'
abstract:
- lang: eng
text: Helhmoltz–Kirchhoff equations of motions of vortices of an incompressible
fluid in the plane define a dynamics with singularities and this leads to a Zermelo
navigation problem describing the ship travel in such a field where the control
is the heading angle. Considering one vortex, we define a time minimization problem
which can be analyzed with the technics of geometric optimal control combined
with numerical simulations, the geometric frame being the extension of Randers
metrics in the punctured plane, with rotational symmetry. Candidates as minimizers
are parameterized thanks to the Pontryagin Maximum Principle as extremal solutions
of a Hamiltonian vector field. We analyze the time minimal solution to transfer
the ship between two points where during the transfer the ship can be either in
a strong current region in the vicinity of the vortex or in a weak current region.
The analysis is based on a micro-local classification of the extremals using mainly
the integrability properties of the dynamics due to the rotational symmetry. The
discussion is complex and related to the existence of an isolated extremal (Reeb)
circle due to the vortex singularity. The explicit computation of cut points where
the extremal curves cease to be optimal is given and the spheres are described
in the case where at the initial point the current is weak.
article_number: S10
author:
- first_name: Bernard
full_name: Bonnard, Bernard
last_name: Bonnard
- first_name: Olivier
full_name: Cots, Olivier
last_name: Cots
- first_name: Boris Edgar
full_name: Wembe Moafo, Boris Edgar
id: '95394'
last_name: Wembe Moafo
citation:
ama: 'Bonnard B, Cots O, Wembe Moafo BE. A Zermelo navigation problem with a vortex
singularity. ESAIM: Control, Optimisation and Calculus of Variations. 2020;27.
doi:10.1051/cocv/2020058'
apa: 'Bonnard, B., Cots, O., & Wembe Moafo, B. E. (2020). A Zermelo navigation
problem with a vortex singularity. ESAIM: Control, Optimisation and Calculus
of Variations, 27, Article S10. https://doi.org/10.1051/cocv/2020058'
bibtex: '@article{Bonnard_Cots_Wembe Moafo_2020, title={A Zermelo navigation problem
with a vortex singularity}, volume={27}, DOI={10.1051/cocv/2020058},
number={S10}, journal={ESAIM: Control, Optimisation and Calculus of Variations},
publisher={EDP Sciences}, author={Bonnard, Bernard and Cots, Olivier and Wembe
Moafo, Boris Edgar}, year={2020} }'
chicago: 'Bonnard, Bernard, Olivier Cots, and Boris Edgar Wembe Moafo. “A Zermelo
Navigation Problem with a Vortex Singularity.” ESAIM: Control, Optimisation
and Calculus of Variations 27 (2020). https://doi.org/10.1051/cocv/2020058.'
ieee: 'B. Bonnard, O. Cots, and B. E. Wembe Moafo, “A Zermelo navigation problem
with a vortex singularity,” ESAIM: Control, Optimisation and Calculus of Variations,
vol. 27, Art. no. S10, 2020, doi: 10.1051/cocv/2020058.'
mla: 'Bonnard, Bernard, et al. “A Zermelo Navigation Problem with a Vortex Singularity.”
ESAIM: Control, Optimisation and Calculus of Variations, vol. 27, S10,
EDP Sciences, 2020, doi:10.1051/cocv/2020058.'
short: 'B. Bonnard, O. Cots, B.E. Wembe Moafo, ESAIM: Control, Optimisation and
Calculus of Variations 27 (2020).'
date_created: 2022-10-24T12:51:05Z
date_updated: 2023-01-16T12:09:22Z
doi: 10.1051/cocv/2020058
intvolume: ' 27'
keyword:
- Computational Mathematics
- Control and Optimization
- Control and Systems Engineering
language:
- iso: eng
publication: 'ESAIM: Control, Optimisation and Calculus of Variations'
publication_identifier:
issn:
- 1292-8119
- 1262-3377
publication_status: published
publisher: EDP Sciences
status: public
title: A Zermelo navigation problem with a vortex singularity
type: journal_article
user_id: '95394'
volume: 27
year: '2020'
...
---
_id: '37828'
abstract:
- lang: eng
text: 'IntroductionNursing staff is burdened
by high workload and stress. Furthermore, heavy lifting, as well as transferring
nursing home residents, cause lumbar tissue damage and back pain. Exercise intervention
studies to reduce work-related problems are rare and the evidence for efficacy
of studies among nurses is limited. Studies including targeted analysis of requirements
are necessary to generate effective recommendations and tailored interventions
for health promotion programmes. The purpose of this multicentred intervention
study is to identify work-related problems, to implement health promotion programmes
and to evaluate their effectiveness.Methods
and analysisA randomised controlled trial will be conducted,
including a total of 48 nursing home facilities in eight regions of Germany with
an estimated sample size of 700 nurses. Standardised ergonomics and posture training
(10 weeks, once a week for 20–30 min) and subsequently, back-fitness training
(12 weeks, once a week for 45–60 min) will be administered. Following the implementation
of standardised health promotion programmes, further demand-oriented interventions
can be implemented. The perceived exposure to work-related demands, work-related
pain in different parts of the body, health-related quality of life, perceived
stress, work-related patterns of behaviour and experience, presentism behaviour,
work environment as well as general needs and barriers to health promotion, will
be assessed at baseline (pre-test), at 10 weeks (post-test, after ergonomics training),
at 22 weeks (post-test, after back-fitness training) and at 34 weeks of the programme
(follow-up).Ethics and disseminationThe
study was reviewed and approved by the local ethics committee of the University
of Hamburg (AZ: 2018_168). The results of the study will be published in open-access
and international journals. Furthermore, the results will be presented in the
participating nursing homes and at national and international conferences.Trial
registration numberDRKS.de (DRKS00015241).'
article_number: e038202
author:
- first_name: Ann-Kathrin
full_name: Otto, Ann-Kathrin
last_name: Otto
- first_name: Juliane
full_name: Pietschmann, Juliane
last_name: Pietschmann
- first_name: Luisa-Marie
full_name: Appelles, Luisa-Marie
last_name: Appelles
- first_name: Michael
full_name: Bebenek, Michael
last_name: Bebenek
- first_name: Laura L
full_name: Bischoff, Laura L
last_name: Bischoff
- first_name: Claudia
full_name: Hildebrand, Claudia
last_name: Hildebrand
- first_name: Bettina
full_name: Johnen, Bettina
last_name: Johnen
- first_name: Thomas
full_name: Jöllenbeck, Thomas
last_name: Jöllenbeck
- first_name: Wolfgang
full_name: Kemmler, Wolfgang
last_name: Kemmler
- first_name: Thomas
full_name: Klotzbier, Thomas
last_name: Klotzbier
- first_name: Heide
full_name: Korbus, Heide
last_name: Korbus
- first_name: Julian
full_name: Rudisch, Julian
last_name: Rudisch
- first_name: Nadja
full_name: Schott, Nadja
last_name: Schott
- first_name: Daniel
full_name: Schoene, Daniel
last_name: Schoene
- first_name: Claudia
full_name: Voelcker-Rehage, Claudia
last_name: Voelcker-Rehage
- first_name: Oliver
full_name: Vogel, Oliver
last_name: Vogel
- first_name: Lutz
full_name: Vogt, Lutz
last_name: Vogt
- first_name: Matthias
full_name: Weigelt, Matthias
id: '36388'
last_name: Weigelt
- first_name: Jan
full_name: Wilke, Jan
last_name: Wilke
- first_name: Katharina
full_name: Zwingmann, Katharina
last_name: Zwingmann
- first_name: Bettina
full_name: Wollesen, Bettina
last_name: Wollesen
citation:
ama: 'Otto A-K, Pietschmann J, Appelles L-M, et al. Physical activity and health
promotion for nursing staff in elderly care: a study protocol for a randomised
controlled trial. BMJ Open. 2020;10(10). doi:10.1136/bmjopen-2020-038202'
apa: 'Otto, A.-K., Pietschmann, J., Appelles, L.-M., Bebenek, M., Bischoff, L. L.,
Hildebrand, C., Johnen, B., Jöllenbeck, T., Kemmler, W., Klotzbier, T., Korbus,
H., Rudisch, J., Schott, N., Schoene, D., Voelcker-Rehage, C., Vogel, O., Vogt,
L., Weigelt, M., Wilke, J., … Wollesen, B. (2020). Physical activity and health
promotion for nursing staff in elderly care: a study protocol for a randomised
controlled trial. BMJ Open, 10(10), Article e038202. https://doi.org/10.1136/bmjopen-2020-038202'
bibtex: '@article{Otto_Pietschmann_Appelles_Bebenek_Bischoff_Hildebrand_Johnen_Jöllenbeck_Kemmler_Klotzbier_et
al._2020, title={Physical activity and health promotion for nursing staff in elderly
care: a study protocol for a randomised controlled trial}, volume={10}, DOI={10.1136/bmjopen-2020-038202},
number={10e038202}, journal={BMJ Open}, publisher={BMJ}, author={Otto, Ann-Kathrin
and Pietschmann, Juliane and Appelles, Luisa-Marie and Bebenek, Michael and Bischoff,
Laura L and Hildebrand, Claudia and Johnen, Bettina and Jöllenbeck, Thomas and
Kemmler, Wolfgang and Klotzbier, Thomas and et al.}, year={2020} }'
chicago: 'Otto, Ann-Kathrin, Juliane Pietschmann, Luisa-Marie Appelles, Michael
Bebenek, Laura L Bischoff, Claudia Hildebrand, Bettina Johnen, et al. “Physical
Activity and Health Promotion for Nursing Staff in Elderly Care: A Study Protocol
for a Randomised Controlled Trial.” BMJ Open 10, no. 10 (2020). https://doi.org/10.1136/bmjopen-2020-038202.'
ieee: 'A.-K. Otto et al., “Physical activity and health promotion for nursing
staff in elderly care: a study protocol for a randomised controlled trial,” BMJ
Open, vol. 10, no. 10, Art. no. e038202, 2020, doi: 10.1136/bmjopen-2020-038202.'
mla: 'Otto, Ann-Kathrin, et al. “Physical Activity and Health Promotion for Nursing
Staff in Elderly Care: A Study Protocol for a Randomised Controlled Trial.” BMJ
Open, vol. 10, no. 10, e038202, BMJ, 2020, doi:10.1136/bmjopen-2020-038202.'
short: A.-K. Otto, J. Pietschmann, L.-M. Appelles, M. Bebenek, L.L. Bischoff, C.
Hildebrand, B. Johnen, T. Jöllenbeck, W. Kemmler, T. Klotzbier, H. Korbus, J.
Rudisch, N. Schott, D. Schoene, C. Voelcker-Rehage, O. Vogel, L. Vogt, M. Weigelt,
J. Wilke, K. Zwingmann, B. Wollesen, BMJ Open 10 (2020).
date_created: 2023-01-21T13:32:54Z
date_updated: 2023-01-23T13:29:21Z
department:
- _id: '266'
doi: 10.1136/bmjopen-2020-038202
intvolume: ' 10'
issue: '10'
keyword:
- General Medicine
language:
- iso: eng
publication: BMJ Open
publication_identifier:
issn:
- 2044-6055
- 2044-6055
publication_status: published
publisher: BMJ
quality_controlled: '1'
status: public
title: 'Physical activity and health promotion for nursing staff in elderly care:
a study protocol for a randomised controlled trial'
type: journal_article
user_id: '75770'
volume: 10
year: '2020'
...
---
_id: '41079'
author:
- first_name: Harald
full_name: Schroeter-Wittke, Harald
id: '480'
last_name: Schroeter-Wittke
- first_name: Inge
full_name: Kirsner, Inge
last_name: Kirsner
citation:
ama: 'Schroeter-Wittke H, Kirsner I. 1. Sonntag nach Weihnachten 27.12.2020. Lukas
2,(22-24)25-38(39-40): Missionarische Spiritualität . Predigtstudien III/1.
Published online 2020:72-79.'
apa: 'Schroeter-Wittke, H., & Kirsner, I. (2020). 1. Sonntag nach Weihnachten
27.12.2020. Lukas 2,(22-24)25-38(39-40): Missionarische Spiritualität . Predigtstudien
III/1, 72–79.'
bibtex: '@article{Schroeter-Wittke_Kirsner_2020, title={1. Sonntag nach Weihnachten
27.12.2020. Lukas 2,(22-24)25-38(39-40): Missionarische Spiritualität }, journal={Predigtstudien
III/1}, publisher={Kreuz-Verlag}, author={Schroeter-Wittke, Harald and Kirsner,
Inge}, year={2020}, pages={72–79} }'
chicago: 'Schroeter-Wittke, Harald, and Inge Kirsner. “1. Sonntag nach Weihnachten
27.12.2020. Lukas 2,(22-24)25-38(39-40): Missionarische Spiritualität .” Predigtstudien
III/1, 2020, 72–79.'
ieee: 'H. Schroeter-Wittke and I. Kirsner, “1. Sonntag nach Weihnachten 27.12.2020.
Lukas 2,(22-24)25-38(39-40): Missionarische Spiritualität ,” Predigtstudien
III/1, pp. 72–79, 2020.'
mla: 'Schroeter-Wittke, Harald, and Inge Kirsner. “1. Sonntag nach Weihnachten 27.12.2020.
Lukas 2,(22-24)25-38(39-40): Missionarische Spiritualität .” Predigtstudien
III/1, Kreuz-Verlag, 2020, pp. 72–79.'
short: H. Schroeter-Wittke, I. Kirsner, Predigtstudien III/1 (2020) 72–79.
date_created: 2023-01-31T00:23:35Z
date_updated: 2023-01-31T01:43:14Z
language:
- iso: ger
page: 72-79
publication: Predigtstudien III/1
publication_identifier:
issn:
- 0079-4961
publication_status: published
publisher: Kreuz-Verlag
status: public
title: '1. Sonntag nach Weihnachten 27.12.2020. Lukas 2,(22-24)25-38(39-40): Missionarische
Spiritualität '
type: journal_article
user_id: '480'
year: '2020'
...
---
_id: '41144'
citation:
ama: Wagenknecht I, Bietz I, Kramer A, Müller S, Stibane F, eds. Kommunale Planung
für Senior*innen bis 2025. Fortschreibung des Altenhilfeplans aus dem Jahr 2013.
Stadt Gießen; 2020.
apa: Wagenknecht, I., Bietz, I., Kramer, A., Müller, S., & Stibane, F. (Eds.).
(2020). Kommunale Planung für Senior*innen bis 2025. Fortschreibung des Altenhilfeplans
aus dem Jahr 2013. Stadt Gießen.
bibtex: '@book{Wagenknecht_Bietz_Kramer_Müller_Stibane_2020, title={Kommunale Planung
für Senior*innen bis 2025. Fortschreibung des Altenhilfeplans aus dem Jahr 2013},
publisher={Stadt Gießen}, year={2020} }'
chicago: Wagenknecht, Inga, I. Bietz, A. Kramer, S. Müller, and F. Stibane, eds.
Kommunale Planung für Senior*innen bis 2025. Fortschreibung des Altenhilfeplans
aus dem Jahr 2013. Stadt Gießen, 2020.
ieee: I. Wagenknecht, I. Bietz, A. Kramer, S. Müller, and F. Stibane, Eds., Kommunale
Planung für Senior*innen bis 2025. Fortschreibung des Altenhilfeplans aus dem
Jahr 2013. Stadt Gießen, 2020.
mla: Wagenknecht, Inga, et al., editors. Kommunale Planung für Senior*innen bis
2025. Fortschreibung des Altenhilfeplans aus dem Jahr 2013. Stadt Gießen,
2020.
short: I. Wagenknecht, I. Bietz, A. Kramer, S. Müller, F. Stibane, eds., Kommunale
Planung für Senior*innen bis 2025. Fortschreibung des Altenhilfeplans aus dem
Jahr 2013, Stadt Gießen, 2020.
date_created: 2023-01-31T09:53:12Z
date_updated: 2023-01-31T09:54:07Z
department:
- _id: '22'
editor:
- first_name: Inga
full_name: Wagenknecht, Inga
id: '98804'
last_name: Wagenknecht
- first_name: I.
full_name: Bietz, I.
last_name: Bietz
- first_name: A.
full_name: Kramer, A.
last_name: Kramer
- first_name: S.
full_name: Müller, S.
last_name: Müller
- first_name: F.
full_name: Stibane, F.
last_name: Stibane
language:
- iso: ger
publication_status: published
publisher: Stadt Gießen
related_material:
link:
- relation: confirmation
url: ' https://www.giessen.de/media/custom/684_10693_1.PDF?1618325932?direct'
status: public
title: Kommunale Planung für Senior*innen bis 2025. Fortschreibung des Altenhilfeplans
aus dem Jahr 2013
type: book_editor
user_id: '50419'
year: '2020'
...
---
_id: '40217'
author:
- first_name: Inga
full_name: Wagenknecht, Inga
id: '98804'
last_name: Wagenknecht
- first_name: Uta
full_name: Meier-Gräwe, Uta
last_name: Meier-Gräwe
citation:
ama: Wagenknecht I, Meier-Gräwe U. Psychische Auffälligkeiten bei Kindern und Jugendlichen,
für die das Jugendamt in Anspruch genommen wurde. Praxis der Kinderpsychologie
und Kinderpsychiatrie. 2020;69(7):643-665. doi:10.13109/prkk.2020.69.7.643
apa: Wagenknecht, I., & Meier-Gräwe, U. (2020). Psychische Auffälligkeiten bei
Kindern und Jugendlichen, für die das Jugendamt in Anspruch genommen wurde. Praxis
der Kinderpsychologie und Kinderpsychiatrie, 69(7), 643–665. https://doi.org/10.13109/prkk.2020.69.7.643
bibtex: '@article{Wagenknecht_Meier-Gräwe_2020, title={Psychische Auffälligkeiten
bei Kindern und Jugendlichen, für die das Jugendamt in Anspruch genommen wurde},
volume={69}, DOI={10.13109/prkk.2020.69.7.643},
number={7}, journal={Praxis der Kinderpsychologie und Kinderpsychiatrie}, publisher={Vandenhoeck
& Ruprecht GmbH & Co, KG}, author={Wagenknecht, Inga and Meier-Gräwe,
Uta}, year={2020}, pages={643–665} }'
chicago: 'Wagenknecht, Inga, and Uta Meier-Gräwe. “Psychische Auffälligkeiten bei
Kindern und Jugendlichen, für die das Jugendamt in Anspruch genommen wurde.” Praxis
der Kinderpsychologie und Kinderpsychiatrie 69, no. 7 (2020): 643–65. https://doi.org/10.13109/prkk.2020.69.7.643.'
ieee: 'I. Wagenknecht and U. Meier-Gräwe, “Psychische Auffälligkeiten bei Kindern
und Jugendlichen, für die das Jugendamt in Anspruch genommen wurde,” Praxis
der Kinderpsychologie und Kinderpsychiatrie, vol. 69, no. 7, pp. 643–665,
2020, doi: 10.13109/prkk.2020.69.7.643.'
mla: Wagenknecht, Inga, and Uta Meier-Gräwe. “Psychische Auffälligkeiten bei Kindern
und Jugendlichen, für die das Jugendamt in Anspruch genommen wurde.” Praxis
der Kinderpsychologie und Kinderpsychiatrie, vol. 69, no. 7, Vandenhoeck &
Ruprecht GmbH & Co, KG, 2020, pp. 643–65, doi:10.13109/prkk.2020.69.7.643.
short: I. Wagenknecht, U. Meier-Gräwe, Praxis der Kinderpsychologie und Kinderpsychiatrie
69 (2020) 643–665.
date_created: 2023-01-26T09:08:15Z
date_updated: 2023-01-26T09:13:40Z
department:
- _id: '22'
doi: 10.13109/prkk.2020.69.7.643
intvolume: ' 69'
issue: '7'
keyword:
- Electrical and Electronic Engineering
- Atomic and Molecular Physics
- and Optics
language:
- iso: ger
page: 643-665
publication: Praxis der Kinderpsychologie und Kinderpsychiatrie
publication_identifier:
eissn:
- 2196-8225
issn:
- 0032-7034
publication_status: published
publisher: Vandenhoeck & Ruprecht GmbH & Co, KG
status: public
title: Psychische Auffälligkeiten bei Kindern und Jugendlichen, für die das Jugendamt
in Anspruch genommen wurde
type: journal_article
user_id: '50419'
volume: 69
year: '2020'
...