---
_id: '49405'
author:
- first_name: Katharina
full_name: Kammeyer, Katharina
id: '60607'
last_name: Kammeyer
- first_name: Naciye
full_name: Kamcili-Yildiz, Naciye
last_name: Kamcili-Yildiz
- first_name: Marion
full_name: Keuchen, Marion
last_name: Keuchen
citation:
ama: Kammeyer K, Kamcili-Yildiz N, Keuchen M. Vertrauenskrise. Ein christlich-muslimisches
Gespräch über Ibrahim und Abraham Prüfung. Junge Kirche. 2019;(80).
apa: Kammeyer, K., Kamcili-Yildiz, N., & Keuchen, M. (2019). Vertrauenskrise.
Ein christlich-muslimisches Gespräch über Ibrahim und Abraham Prüfung. Junge
Kirche, 80.
bibtex: '@article{Kammeyer_Kamcili-Yildiz_Keuchen_2019, title={Vertrauenskrise.
Ein christlich-muslimisches Gespräch über Ibrahim und Abraham Prüfung}, number={80},
journal={Junge Kirche}, publisher={Erev-Rav}, author={Kammeyer, Katharina and
Kamcili-Yildiz, Naciye and Keuchen, Marion}, year={2019} }'
chicago: Kammeyer, Katharina, Naciye Kamcili-Yildiz, and Marion Keuchen. “Vertrauenskrise.
Ein christlich-muslimisches Gespräch über Ibrahim und Abraham Prüfung.” Junge
Kirche, no. 80 (2019).
ieee: K. Kammeyer, N. Kamcili-Yildiz, and M. Keuchen, “Vertrauenskrise. Ein christlich-muslimisches
Gespräch über Ibrahim und Abraham Prüfung,” Junge Kirche, no. 80, 2019.
mla: Kammeyer, Katharina, et al. “Vertrauenskrise. Ein christlich-muslimisches Gespräch
über Ibrahim und Abraham Prüfung.” Junge Kirche, no. 80, Erev-Rav, 2019.
short: K. Kammeyer, N. Kamcili-Yildiz, M. Keuchen, Junge Kirche (2019).
date_created: 2023-12-04T08:53:58Z
date_updated: 2023-12-04T08:54:02Z
issue: '80'
language:
- iso: ger
publication: Junge Kirche
publication_status: published
publisher: Erev-Rav
status: public
title: Vertrauenskrise. Ein christlich-muslimisches Gespräch über Ibrahim und Abraham
Prüfung
type: journal_article
user_id: '60607'
year: '2019'
...
---
_id: '34917'
abstract:
- lang: eng
text: We relate proper isometry classes of maximal lattices in a totally definite
quaternary quadratic space (V,q) with trivial discriminant to certain equivalence
classes of ideals in the quaternion algebra representing the Clifford invariant
of (V,q). This yields a good algorithm to enumerate a system of representatives
of proper isometry classes of lattices in genera of maximal lattices in (V,q).
author:
- first_name: Markus
full_name: Kirschmer, Markus
id: '82258'
last_name: Kirschmer
- first_name: Gabriele
full_name: Nebe, Gabriele
last_name: Nebe
citation:
ama: Kirschmer M, Nebe G. Quaternary quadratic lattices over number fields. International
Journal of Number Theory. 2019;15(02):309-325. doi:10.1142/s1793042119500131
apa: Kirschmer, M., & Nebe, G. (2019). Quaternary quadratic lattices over number
fields. International Journal of Number Theory, 15(02), 309–325.
https://doi.org/10.1142/s1793042119500131
bibtex: '@article{Kirschmer_Nebe_2019, title={Quaternary quadratic lattices over
number fields}, volume={15}, DOI={10.1142/s1793042119500131},
number={02}, journal={International Journal of Number Theory}, publisher={World
Scientific Pub Co Pte Lt}, author={Kirschmer, Markus and Nebe, Gabriele}, year={2019},
pages={309–325} }'
chicago: 'Kirschmer, Markus, and Gabriele Nebe. “Quaternary Quadratic Lattices over
Number Fields.” International Journal of Number Theory 15, no. 02 (2019):
309–25. https://doi.org/10.1142/s1793042119500131.'
ieee: 'M. Kirschmer and G. Nebe, “Quaternary quadratic lattices over number fields,”
International Journal of Number Theory, vol. 15, no. 02, pp. 309–325, 2019,
doi: 10.1142/s1793042119500131.'
mla: Kirschmer, Markus, and Gabriele Nebe. “Quaternary Quadratic Lattices over Number
Fields.” International Journal of Number Theory, vol. 15, no. 02, World
Scientific Pub Co Pte Lt, 2019, pp. 309–25, doi:10.1142/s1793042119500131.
short: M. Kirschmer, G. Nebe, International Journal of Number Theory 15 (2019) 309–325.
date_created: 2022-12-23T11:05:09Z
date_updated: 2023-12-06T10:05:59Z
department:
- _id: '102'
doi: 10.1142/s1793042119500131
intvolume: ' 15'
issue: '02'
keyword:
- Algebra and Number Theory
language:
- iso: eng
page: 309-325
publication: International Journal of Number Theory
publication_identifier:
issn:
- 1793-0421
- 1793-7310
publication_status: published
publisher: World Scientific Pub Co Pte Lt
status: public
title: Quaternary quadratic lattices over number fields
type: journal_article
user_id: '82258'
volume: 15
year: '2019'
...
---
_id: '34916'
abstract:
- lang: eng
text: We describe the powers of irreducible polynomials occurring as characteristic
polynomials of automorphisms of even unimodular lattices over number fields. This
generalizes results of Gross & McMullen and Bayer-Fluckiger & Taelman.
author:
- first_name: Markus
full_name: Kirschmer, Markus
id: '82258'
last_name: Kirschmer
citation:
ama: Kirschmer M. Automorphisms of even unimodular lattices over number fields.
Journal of Number Theory. 2019;197:121-134. doi:10.1016/j.jnt.2018.08.004
apa: Kirschmer, M. (2019). Automorphisms of even unimodular lattices over number
fields. Journal of Number Theory, 197, 121–134. https://doi.org/10.1016/j.jnt.2018.08.004
bibtex: '@article{Kirschmer_2019, title={Automorphisms of even unimodular lattices
over number fields}, volume={197}, DOI={10.1016/j.jnt.2018.08.004},
journal={Journal of Number Theory}, publisher={Elsevier BV}, author={Kirschmer,
Markus}, year={2019}, pages={121–134} }'
chicago: 'Kirschmer, Markus. “Automorphisms of Even Unimodular Lattices over Number
Fields.” Journal of Number Theory 197 (2019): 121–34. https://doi.org/10.1016/j.jnt.2018.08.004.'
ieee: 'M. Kirschmer, “Automorphisms of even unimodular lattices over number fields,”
Journal of Number Theory, vol. 197, pp. 121–134, 2019, doi: 10.1016/j.jnt.2018.08.004.'
mla: Kirschmer, Markus. “Automorphisms of Even Unimodular Lattices over Number Fields.”
Journal of Number Theory, vol. 197, Elsevier BV, 2019, pp. 121–34, doi:10.1016/j.jnt.2018.08.004.
short: M. Kirschmer, Journal of Number Theory 197 (2019) 121–134.
date_created: 2022-12-23T11:04:34Z
date_updated: 2023-12-06T10:07:17Z
department:
- _id: '102'
doi: 10.1016/j.jnt.2018.08.004
intvolume: ' 197'
keyword:
- Algebra and Number Theory
language:
- iso: eng
page: 121-134
publication: Journal of Number Theory
publication_identifier:
issn:
- 0022-314X
publication_status: published
publisher: Elsevier BV
status: public
title: Automorphisms of even unimodular lattices over number fields
type: journal_article
user_id: '82258'
volume: 197
year: '2019'
...
---
_id: '47083'
author:
- first_name: Wolfgang
full_name: Habla, Wolfgang
last_name: Habla
- first_name: Vera
full_name: Huwe, Vera
last_name: Huwe
- first_name: Martin
full_name: Kesternich, Martin
id: '98922'
last_name: Kesternich
citation:
ama: 'Habla W, Huwe V, Kesternich M. Tempolimits und Grenzwerte: für eine evidenzbasierte
verkehrspolitische Debatte. Vol 99(5). Wirtschaftsdienst 99(5), 330-334; 2019:330-334.
doi:10.1007/s10273-019-2452-6'
apa: 'Habla, W., Huwe, V., & Kesternich, M. (2019). Tempolimits und Grenzwerte:
für eine evidenzbasierte verkehrspolitische Debatte: Vol. 99(5) (pp. 330–334).
Wirtschaftsdienst 99(5), 330-334. https://doi.org/10.1007/s10273-019-2452-6'
bibtex: '@book{Habla_Huwe_Kesternich_2019, series={Wirtschaftsdienst}, title={Tempolimits
und Grenzwerte: für eine evidenzbasierte verkehrspolitische Debatte}, volume={99(5)},
DOI={10.1007/s10273-019-2452-6},
publisher={Wirtschaftsdienst 99(5), 330-334}, author={Habla, Wolfgang and Huwe,
Vera and Kesternich, Martin}, year={2019}, pages={330–334}, collection={Wirtschaftsdienst}
}'
chicago: 'Habla, Wolfgang, Vera Huwe, and Martin Kesternich. Tempolimits und
Grenzwerte: für eine evidenzbasierte verkehrspolitische Debatte. Vol. 99(5).
Wirtschaftsdienst. Wirtschaftsdienst 99(5), 330-334, 2019. https://doi.org/10.1007/s10273-019-2452-6.'
ieee: 'W. Habla, V. Huwe, and M. Kesternich, Tempolimits und Grenzwerte: für
eine evidenzbasierte verkehrspolitische Debatte, vol. 99(5). Wirtschaftsdienst
99(5), 330-334, 2019, pp. 330–334.'
mla: 'Habla, Wolfgang, et al. Tempolimits und Grenzwerte: für eine evidenzbasierte
verkehrspolitische Debatte. Wirtschaftsdienst 99(5), 330-334, 2019, pp. 330–34,
doi:10.1007/s10273-019-2452-6.'
short: 'W. Habla, V. Huwe, M. Kesternich, Tempolimits und Grenzwerte: für eine evidenzbasierte
verkehrspolitische Debatte, Wirtschaftsdienst 99(5), 330-334, 2019.'
date_created: 2023-09-15T11:51:12Z
date_updated: 2023-12-06T18:28:16Z
doi: 10.1007/s10273-019-2452-6
keyword:
- Business
- Management and Accounting (miscellaneous)
language:
- iso: ger
page: 330-334
publication_identifier:
issn:
- 0043-6275
- 1613-978X
publication_status: published
publisher: Wirtschaftsdienst 99(5), 330-334
series_title: Wirtschaftsdienst
status: public
title: 'Tempolimits und Grenzwerte: für eine evidenzbasierte verkehrspolitische Debatte'
type: working_paper
user_id: '98922'
volume: 99(5)
year: '2019'
...
---
_id: '47081'
author:
- first_name: Martin
full_name: Kesternich, Martin
id: '98922'
last_name: Kesternich
citation:
ama: 'Kesternich M. Eine City-Maut Ist Diesel-Fahrverboten in Städten Klar Überlegen.
MRN: E-Mobilität in der Metropolregion Rhein-Neckar; 2019.'
apa: 'Kesternich, M. (2019). Eine City-Maut ist Diesel-Fahrverboten in Städten
klar überlegen. MRN: E-Mobilität in der Metropolregion Rhein-Neckar.'
bibtex: '@book{Kesternich_2019, title={Eine City-Maut ist Diesel-Fahrverboten in
Städten klar überlegen}, publisher={MRN: E-Mobilität in der Metropolregion Rhein-Neckar},
author={Kesternich, Martin}, year={2019} }'
chicago: 'Kesternich, Martin. Eine City-Maut Ist Diesel-Fahrverboten in Städten
Klar Überlegen. MRN: E-Mobilität in der Metropolregion Rhein-Neckar, 2019.'
ieee: 'M. Kesternich, Eine City-Maut ist Diesel-Fahrverboten in Städten klar
überlegen. MRN: E-Mobilität in der Metropolregion Rhein-Neckar, 2019.'
mla: 'Kesternich, Martin. Eine City-Maut Ist Diesel-Fahrverboten in Städten Klar
Überlegen. MRN: E-Mobilität in der Metropolregion Rhein-Neckar, 2019.'
short: 'M. Kesternich, Eine City-Maut Ist Diesel-Fahrverboten in Städten Klar Überlegen,
MRN: E-Mobilität in der Metropolregion Rhein-Neckar, 2019.'
date_created: 2023-09-15T11:49:55Z
date_updated: 2023-12-06T18:29:55Z
language:
- iso: eng
publisher: 'MRN: E-Mobilität in der Metropolregion Rhein-Neckar'
status: public
title: Eine City-Maut ist Diesel-Fahrverboten in Städten klar überlegen
type: working_paper
user_id: '98922'
year: '2019'
...
---
_id: '49536'
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. Ethik zwischen Universalisierbarkeit und Lebensnähe.
Zeitimplikate in den Referenzbegriffen der Ethikdefinition. Evangelische Theologie
79. Published online 2019:210–222.
apa: Meyer zu Hörste-Bührer, R. (2019). Ethik zwischen Universalisierbarkeit und
Lebensnähe. Zeitimplikate in den Referenzbegriffen der Ethikdefinition. Evangelische
Theologie 79, 210–222.
bibtex: '@article{Meyer zu Hörste-Bührer_2019, title={Ethik zwischen Universalisierbarkeit
und Lebensnähe. Zeitimplikate in den Referenzbegriffen der Ethikdefinition}, journal={Evangelische
Theologie 79}, author={Meyer zu Hörste-Bührer, Raphaela}, year={2019}, pages={210–222}
}'
chicago: Meyer zu Hörste-Bührer, Raphaela. “Ethik Zwischen Universalisierbarkeit
Und Lebensnähe. Zeitimplikate in Den Referenzbegriffen Der Ethikdefinition.” Evangelische
Theologie 79, 2019, 210–222.
ieee: R. Meyer zu Hörste-Bührer, “Ethik zwischen Universalisierbarkeit und Lebensnähe.
Zeitimplikate in den Referenzbegriffen der Ethikdefinition,” Evangelische Theologie
79, pp. 210–222, 2019.
mla: Meyer zu Hörste-Bührer, Raphaela. “Ethik Zwischen Universalisierbarkeit Und
Lebensnähe. Zeitimplikate in Den Referenzbegriffen Der Ethikdefinition.” Evangelische
Theologie 79, 2019, pp. 210–222.
short: R. Meyer zu Hörste-Bührer, Evangelische Theologie 79 (2019) 210–222.
date_created: 2023-12-07T11:15:58Z
date_updated: 2023-12-13T07:30:12Z
language:
- iso: eng
page: 210–222
publication: Evangelische Theologie 79
status: public
title: Ethik zwischen Universalisierbarkeit und Lebensnähe. Zeitimplikate in den Referenzbegriffen
der Ethikdefinition
type: journal_article
user_id: '102100'
year: '2019'
...
---
_id: '49537'
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. Editorial: Ethik in Antike und Christentum / Editorial:
Ethics in Antiquity and Christianity. Journal of Ethics in Antiquity and Christianity
1 . Published online 2019:3-8.'
apa: 'Meyer zu Hörste-Bührer, R. (2019). Editorial: Ethik in Antike und Christentum
/ Editorial: Ethics in Antiquity and Christianity. Journal of Ethics in Antiquity
and Christianity 1 , 3–8.'
bibtex: '@article{Meyer zu Hörste-Bührer_2019, title={Editorial: Ethik in Antike
und Christentum / Editorial: Ethics in Antiquity and Christianity}, journal={Journal
of Ethics in Antiquity and Christianity 1 }, author={Meyer zu Hörste-Bührer, Raphaela},
year={2019}, pages={3–8} }'
chicago: 'Meyer zu Hörste-Bührer, Raphaela. “Editorial: Ethik in Antike Und Christentum
/ Editorial: Ethics in Antiquity and Christianity.” Journal of Ethics in Antiquity
and Christianity 1 , 2019, 3–8.'
ieee: 'R. Meyer zu Hörste-Bührer, “Editorial: Ethik in Antike und Christentum /
Editorial: Ethics in Antiquity and Christianity,” Journal of Ethics in Antiquity
and Christianity 1 , pp. 3–8, 2019.'
mla: 'Meyer zu Hörste-Bührer, Raphaela. “Editorial: Ethik in Antike Und Christentum
/ Editorial: Ethics in Antiquity and Christianity.” Journal of Ethics in Antiquity
and Christianity 1 , 2019, pp. 3–8.'
short: R. Meyer zu Hörste-Bührer, Journal of Ethics in Antiquity and Christianity
1 (2019) 3–8.
date_created: 2023-12-07T11:18:01Z
date_updated: 2023-12-13T07:29:38Z
language:
- iso: eng
page: 3-8
publication: 'Journal of Ethics in Antiquity and Christianity 1 '
status: public
title: 'Editorial: Ethik in Antike und Christentum / Editorial: Ethics in Antiquity
and Christianity'
type: journal_article
user_id: '102100'
year: '2019'
...
---
_id: '48841'
abstract:
- lang: eng
text: We tackle a bi-objective dynamic orienteering problem where customer requests
arise as time passes by. The goal is to minimize the tour length traveled by a
single delivery vehicle while simultaneously keeping the number of dismissed dynamic
customers to a minimum. We propose a dynamic Evolutionary Multi-Objective Algorithm
which is grounded on insights gained from a previous series of work on an a-posteriori
version of the problem, where all request times are known in advance. In our experiments,
we simulate different decision maker strategies and evaluate the development of
the Pareto-front approximations on exemplary problem instances. It turns out,
that despite severely reduced computational budget and no oracle-knowledge of
request times the dynamic EMOA is capable of producing approximations which partially
dominate the results of the a-posteriori EMOA and dynamic integer linear programming
strategies.
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: Stephan
full_name: Meisel, Stephan
last_name: Meisel
- first_name: Günter
full_name: Rudolph, Günter
last_name: Rudolph
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Bossek J, Grimme C, Meisel S, Rudolph G, Trautmann H. Bi-Objective Orienteering:
Towards a Dynamic Multi-objective Evolutionary Algorithm. In: Deb K, Goodman E,
Coello Coello CA, et al., eds. Evolutionary Multi-Criterion Optimization (EMO).
Lecture Notes in Computer Science. Springer International Publishing; 2019:516–528.
doi:10.1007/978-3-030-12598-1_41'
apa: 'Bossek, J., Grimme, C., Meisel, S., Rudolph, G., & Trautmann, H. (2019).
Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm.
In K. Deb, E. Goodman, C. A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim,
& P. Reed (Eds.), Evolutionary Multi-Criterion Optimization (EMO) (pp.
516–528). Springer International Publishing. https://doi.org/10.1007/978-3-030-12598-1_41'
bibtex: '@inproceedings{Bossek_Grimme_Meisel_Rudolph_Trautmann_2019, place={Cham},
series={Lecture Notes in Computer Science}, title={Bi-Objective Orienteering:
Towards a Dynamic Multi-objective Evolutionary Algorithm}, DOI={10.1007/978-3-030-12598-1_41},
booktitle={Evolutionary Multi-Criterion Optimization (EMO)}, publisher={Springer
International Publishing}, author={Bossek, Jakob and Grimme, Christian and Meisel,
Stephan and Rudolph, Günter and Trautmann, Heike}, editor={Deb, Kalyanmoy and
Goodman, Erik and Coello Coello, Carlos A. and Klamroth, Kathrin and Miettinen,
Kaisa and Mostaghim, Sanaz and Reed, Patrick}, year={2019}, pages={516–528}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Bossek, Jakob, Christian Grimme, Stephan Meisel, Günter Rudolph, and Heike
Trautmann. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary
Algorithm.” In Evolutionary Multi-Criterion Optimization (EMO), edited
by Kalyanmoy Deb, Erik Goodman, Carlos A. Coello Coello, Kathrin Klamroth, Kaisa
Miettinen, Sanaz Mostaghim, and Patrick Reed, 516–528. Lecture Notes in Computer
Science. Cham: Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-12598-1_41.'
ieee: 'J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Bi-Objective
Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm,” in Evolutionary
Multi-Criterion Optimization (EMO), 2019, pp. 516–528, doi: 10.1007/978-3-030-12598-1_41.'
mla: 'Bossek, Jakob, et al. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective
Evolutionary Algorithm.” Evolutionary Multi-Criterion Optimization (EMO),
edited by Kalyanmoy Deb et al., Springer International Publishing, 2019, pp. 516–528,
doi:10.1007/978-3-030-12598-1_41.'
short: 'J. Bossek, C. Grimme, S. Meisel, G. Rudolph, H. Trautmann, in: K. Deb, E.
Goodman, C.A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim, P. Reed
(Eds.), Evolutionary Multi-Criterion Optimization (EMO), Springer International
Publishing, Cham, 2019, pp. 516–528.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:43:07Z
department:
- _id: '819'
doi: 10.1007/978-3-030-12598-1_41
editor:
- first_name: Kalyanmoy
full_name: Deb, Kalyanmoy
last_name: Deb
- first_name: Erik
full_name: Goodman, Erik
last_name: Goodman
- first_name: Carlos A.
full_name: Coello Coello, Carlos A.
last_name: Coello Coello
- first_name: Kathrin
full_name: Klamroth, Kathrin
last_name: Klamroth
- first_name: Kaisa
full_name: Miettinen, Kaisa
last_name: Miettinen
- first_name: Sanaz
full_name: Mostaghim, Sanaz
last_name: Mostaghim
- first_name: Patrick
full_name: Reed, Patrick
last_name: Reed
extern: '1'
keyword:
- Combinatorial optimization
- Dynamic optimization
- Metaheuristics
- Multi-objective optimization
- Vehicle routing
language:
- iso: eng
page: 516–528
place: Cham
publication: Evolutionary Multi-Criterion Optimization (EMO)
publication_identifier:
isbn:
- 978-3-030-12598-1
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: 'Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary
Algorithm'
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48842'
abstract:
- lang: eng
text: 'Evolutionary algorithms have successfully been applied to evolve problem
instances that exhibit a significant difference in performance for a given algorithm
or a pair of algorithms inter alia for the Traveling Salesperson Problem (TSP).
Creating a large variety of instances is crucial for successful applications in
the blooming field of algorithm selection. In this paper, we introduce new and
creative mutation operators for evolving instances of the TSP. We show that adopting
those operators in an evolutionary algorithm allows for the generation of benchmark
sets with highly desirable properties: (1) novelty by clear visual distinction
to established benchmark sets in the field, (2) visual and quantitative diversity
in the space of TSP problem characteristics, and (3) significant performance differences
with respect to the restart versions of heuristic state-of-the-art TSP solvers
EAX and LKH. The important aspect of diversity is addressed and achieved solely
by the proposed mutation operators and not enforced by explicit diversity preservation.'
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: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Bossek J, Kerschke P, Neumann A, Wagner M, Neumann F, Trautmann H. Evolving
Diverse TSP Instances by Means of Novel and Creative Mutation Operators. In: Proceedings
of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. FOGA
’19. Association for Computing Machinery; 2019:58–71. doi:10.1145/3299904.3340307'
apa: Bossek, J., Kerschke, P., Neumann, A., Wagner, M., Neumann, F., & Trautmann,
H. (2019). Evolving Diverse TSP Instances by Means of Novel and Creative Mutation
Operators. Proceedings of the 15th ACM/SIGEVO Conference on Foundations of
Genetic Algorithms, 58–71. https://doi.org/10.1145/3299904.3340307
bibtex: '@inproceedings{Bossek_Kerschke_Neumann_Wagner_Neumann_Trautmann_2019, place={New
York, NY, USA}, series={FOGA ’19}, title={Evolving Diverse TSP Instances by Means
of Novel and Creative Mutation Operators}, DOI={10.1145/3299904.3340307},
booktitle={Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms}, publisher={Association for Computing Machinery}, author={Bossek,
Jakob and Kerschke, Pascal and Neumann, Aneta and Wagner, Markus and Neumann,
Frank and Trautmann, Heike}, year={2019}, pages={58–71}, collection={FOGA ’19}
}'
chicago: 'Bossek, Jakob, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann,
and Heike Trautmann. “Evolving Diverse TSP Instances by Means of Novel and Creative
Mutation Operators.” In Proceedings of the 15th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms, 58–71. FOGA ’19. New York, NY, USA: Association for
Computing Machinery, 2019. https://doi.org/10.1145/3299904.3340307.'
ieee: 'J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, and H. Trautmann,
“Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators,”
in Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms, 2019, pp. 58–71, doi: 10.1145/3299904.3340307.'
mla: Bossek, Jakob, et al. “Evolving Diverse TSP Instances by Means of Novel and
Creative Mutation Operators.” Proceedings of the 15th ACM/SIGEVO Conference
on Foundations of Genetic Algorithms, Association for Computing Machinery,
2019, pp. 58–71, doi:10.1145/3299904.3340307.
short: 'J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, H. Trautmann,
in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms,
Association for Computing Machinery, New York, NY, USA, 2019, pp. 58–71.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:42:57Z
department:
- _id: '819'
doi: 10.1145/3299904.3340307
extern: '1'
keyword:
- benchmarking
- instance features
- optimization
- problem generation
- traveling salesperson problem
language:
- iso: eng
page: 58–71
place: New York, NY, USA
publication: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms
publication_identifier:
isbn:
- 978-1-4503-6254-2
publication_status: published
publisher: Association for Computing Machinery
series_title: FOGA ’19
status: public
title: Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48843'
abstract:
- lang: eng
text: We contribute to the theoretical understanding of randomized search heuristics
for dynamic problems. We consider the classical graph coloring problem 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.
This includes the (1+1) EA and RLS in a setting where the number of colors is
bounded and we are minimizing the number of conflicts as well as iterated local
search algorithms that use an unbounded color palette and aim to use the smallest
colors and - as a consequence - 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. Furthermore, we show
how to speed up computations by using problem specific operators concentrating
on parts of the graph where changes have occurred.
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. Runtime Analysis of Randomized Search
Heuristics for Dynamic Graph Coloring. In: Proceedings of the Genetic and Evolutionary
Computation Conference. GECCO ’19. Association for Computing Machinery; 2019:1443–1451.
doi:10.1145/3321707.3321792'
apa: Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2019). Runtime Analysis
of Randomized Search Heuristics for Dynamic Graph Coloring. Proceedings of
the Genetic and Evolutionary Computation Conference, 1443–1451. https://doi.org/10.1145/3321707.3321792
bibtex: '@inproceedings{Bossek_Neumann_Peng_Sudholt_2019, place={New York, NY, USA},
series={GECCO ’19}, title={Runtime Analysis of Randomized Search Heuristics for
Dynamic Graph Coloring}, DOI={10.1145/3321707.3321792},
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={2019}, pages={1443–1451}, collection={GECCO
’19} }'
chicago: 'Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Runtime Analysis
of Randomized Search Heuristics for Dynamic Graph Coloring.” In Proceedings
of the Genetic and Evolutionary Computation Conference, 1443–1451. GECCO ’19.
New York, NY, USA: Association for Computing Machinery, 2019. https://doi.org/10.1145/3321707.3321792.'
ieee: 'J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Runtime Analysis of Randomized
Search Heuristics for Dynamic Graph Coloring,” in Proceedings of the Genetic
and Evolutionary Computation Conference, 2019, pp. 1443–1451, doi: 10.1145/3321707.3321792.'
mla: Bossek, Jakob, et al. “Runtime Analysis of Randomized Search Heuristics for
Dynamic Graph Coloring.” Proceedings of the Genetic and Evolutionary Computation
Conference, Association for Computing Machinery, 2019, pp. 1443–1451, doi:10.1145/3321707.3321792.
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, 2019, pp. 1443–1451.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:42:37Z
department:
- _id: '819'
doi: 10.1145/3321707.3321792
extern: '1'
keyword:
- dynamic optimization
- evolutionary algorithms
- running time analysis
- theory
language:
- iso: eng
page: 1443–1451
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-6111-8
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’19
status: public
title: Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48840'
abstract:
- lang: eng
text: Research has shown that for many single-objective graph problems where optimum
solutions are composed of low weight sub-graphs, such as the minimum spanning
tree problem (MST), mutation operators favoring low weight edges show superior
performance. Intuitively, similar observations should hold for multi-criteria
variants of such problems. In this work, we focus on the multi-criteria MST problem.
A thorough experimental study is conducted where we estimate the probability of
edges being part of non-dominated spanning trees as a function of the edges’ non-domination
level or domination count, respectively. Building on gained insights, we propose
several biased one-edge-exchange mutation operators that differ in the used edge-selection
probability distribution (biased towards edges of low rank). Our empirical analysis
shows that among different graph types (dense and sparse) and edge weight types
(both uniformly random and combinations of Euclidean and uniformly random) biased
edge-selection strategies perform superior in contrast to the baseline uniform
edge-selection. Our findings are in particular strong for dense graphs.
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: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Bossek J, Grimme C, Neumann F. On the Benefits of Biased Edge-Exchange Mutation
for the Multi-Criteria Spanning Tree Problem. In: Proceedings of the Genetic
and Evolutionary Computation Conference. GECCO ’19. Association for Computing
Machinery; 2019:516–523. doi:10.1145/3321707.3321818'
apa: Bossek, J., Grimme, C., & Neumann, F. (2019). On the Benefits of Biased
Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem. Proceedings
of the Genetic and Evolutionary Computation Conference, 516–523. https://doi.org/10.1145/3321707.3321818
bibtex: '@inproceedings{Bossek_Grimme_Neumann_2019, place={New York, NY, USA}, series={GECCO
’19}, title={On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria
Spanning Tree Problem}, DOI={10.1145/3321707.3321818},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme,
Christian and Neumann, Frank}, year={2019}, pages={516–523}, collection={GECCO
’19} }'
chicago: 'Bossek, Jakob, Christian Grimme, and Frank Neumann. “On the Benefits of
Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem.” In
Proceedings of the Genetic and Evolutionary Computation Conference, 516–523.
GECCO ’19. New York, NY, USA: Association for Computing Machinery, 2019. https://doi.org/10.1145/3321707.3321818.'
ieee: 'J. Bossek, C. Grimme, and F. Neumann, “On the Benefits of Biased Edge-Exchange
Mutation for the Multi-Criteria Spanning Tree Problem,” in Proceedings of the
Genetic and Evolutionary Computation Conference, 2019, pp. 516–523, doi: 10.1145/3321707.3321818.'
mla: Bossek, Jakob, et al. “On the Benefits of Biased Edge-Exchange Mutation for
the Multi-Criteria Spanning Tree Problem.” Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, 2019, pp. 516–523,
doi:10.1145/3321707.3321818.
short: 'J. Bossek, C. Grimme, F. Neumann, in: Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, New York, NY, USA,
2019, pp. 516–523.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:42:24Z
department:
- _id: '819'
doi: 10.1145/3321707.3321818
extern: '1'
keyword:
- biased mutation
- combinatorial optimization
- minimum spanning tree
- multi-objective optimization
language:
- iso: eng
page: 516–523
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-6111-8
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’19
status: public
title: On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning
Tree Problem
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48858'
abstract:
- lang: eng
text: The $$\textbackslash mathcal NP$$-hard multi-criteria shortest path problem
(mcSPP) is of utmost practical relevance, e.~g., in navigation system design and
logistics. We address the problem of approximating the Pareto-front of the mcSPP
with sum objectives. We do so by proposing a new mutation operator for multi-objective
evolutionary algorithms that solves single-objective versions of the shortest
path problem on subgraphs. A rigorous empirical benchmark on a diverse set of
problem instances shows the effectiveness of the approach in comparison to a well-known
mutation operator in terms of convergence speed and approximation quality. In
addition, we glance at the neighbourhood structure and similarity of obtained
Pareto-optimal solutions and derive promising directions for future work.
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
citation:
ama: 'Bossek J, Grimme C. Solving Scalarized Subproblems within Evolutionary Algorithms
for Multi-criteria Shortest Path Problems. In: Battiti R, Brunato M, Kotsireas
I, Pardalos PM, eds. Learning and Intelligent Optimization. Lecture Notes
in Computer Science. Springer International Publishing; 2019:184–198. doi:10.1007/978-3-030-05348-2_17'
apa: Bossek, J., & Grimme, C. (2019). Solving Scalarized Subproblems within
Evolutionary Algorithms for Multi-criteria Shortest Path Problems. In R. Battiti,
M. Brunato, I. Kotsireas, & P. M. Pardalos (Eds.), Learning and Intelligent
Optimization (pp. 184–198). Springer International Publishing. https://doi.org/10.1007/978-3-030-05348-2_17
bibtex: '@inproceedings{Bossek_Grimme_2019, place={Cham}, series={Lecture Notes
in Computer Science}, title={Solving Scalarized Subproblems within Evolutionary
Algorithms for Multi-criteria Shortest Path Problems}, DOI={10.1007/978-3-030-05348-2_17},
booktitle={Learning and Intelligent Optimization}, publisher={Springer International
Publishing}, author={Bossek, Jakob and Grimme, Christian}, editor={Battiti, Roberto
and Brunato, Mauro and Kotsireas, Ilias and Pardalos, Panos M.}, year={2019},
pages={184–198}, collection={Lecture Notes in Computer Science} }'
chicago: 'Bossek, Jakob, and Christian Grimme. “Solving Scalarized Subproblems within
Evolutionary Algorithms for Multi-Criteria Shortest Path Problems.” In Learning
and Intelligent Optimization, edited by Roberto Battiti, Mauro Brunato, Ilias
Kotsireas, and Panos M. Pardalos, 184–198. Lecture Notes in Computer Science.
Cham: Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-05348-2_17.'
ieee: 'J. Bossek and C. Grimme, “Solving Scalarized Subproblems within Evolutionary
Algorithms for Multi-criteria Shortest Path Problems,” in Learning and Intelligent
Optimization, 2019, pp. 184–198, doi: 10.1007/978-3-030-05348-2_17.'
mla: Bossek, Jakob, and Christian Grimme. “Solving Scalarized Subproblems within
Evolutionary Algorithms for Multi-Criteria Shortest Path Problems.” Learning
and Intelligent Optimization, edited by Roberto Battiti et al., Springer International
Publishing, 2019, pp. 184–198, doi:10.1007/978-3-030-05348-2_17.
short: 'J. Bossek, C. Grimme, in: R. Battiti, M. Brunato, I. Kotsireas, P.M. Pardalos
(Eds.), Learning and Intelligent Optimization, Springer International Publishing,
Cham, 2019, pp. 184–198.'
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:44:44Z
department:
- _id: '819'
doi: 10.1007/978-3-030-05348-2_17
editor:
- first_name: Roberto
full_name: Battiti, Roberto
last_name: Battiti
- first_name: Mauro
full_name: Brunato, Mauro
last_name: Brunato
- first_name: Ilias
full_name: Kotsireas, Ilias
last_name: Kotsireas
- first_name: Panos M.
full_name: Pardalos, Panos M.
last_name: Pardalos
extern: '1'
language:
- iso: eng
page: 184–198
place: Cham
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-030-05348-2
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria
Shortest Path Problems
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48870'
abstract:
- lang: eng
text: The edge coloring problem asks for an assignment of colors to edges of a graph
such that no two incident edges share the same color and the number of colors
is minimized. It is known that all graphs with maximum degree {$\Delta$} can be
colored with {$\Delta$} or {$\Delta$} + 1 colors, but it is NP-hard to determine
whether {$\Delta$} colors are sufficient. We present the first runtime analysis
of evolutionary algorithms (EAs) for the edge coloring problem. Simple EAs such
as RLS and (1+1) EA efficiently find (2{$\Delta$} - 1)-colorings on arbitrary
graphs and optimal colorings for even and odd cycles, paths, star graphs and arbitrary
trees. A partial analysis for toroids also suggests efficient runtimes in bipartite
graphs with many cycles. Experiments support these findings and investigate additional
graph classes such as hypercubes, complete graphs and complete bipartite graphs.
Theoretical and experimental results suggest that simple EAs find optimal colorings
for all these graph classes in expected time O({$\Delta\mathscrl$}2m log m), where
m is the number of edges and {$\mathscrl$} is the length of the longest simple
path in the graph.
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. Time Complexity Analysis of RLS and (1 + 1) EA for the
Edge Coloring Problem. In: Proceedings of the 15th ACM/SIGEVO Conference on
Foundations of Genetic Algorithms. FOGA ’19. Association for Computing Machinery;
2019:102–115. doi:10.1145/3299904.3340311'
apa: Bossek, J., & Sudholt, D. (2019). Time Complexity Analysis of RLS and (1
+ 1) EA for the Edge Coloring Problem. Proceedings of the 15th ACM/SIGEVO Conference
on Foundations of Genetic Algorithms, 102–115. https://doi.org/10.1145/3299904.3340311
bibtex: '@inproceedings{Bossek_Sudholt_2019, place={New York, NY, USA}, series={FOGA
’19}, title={Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring
Problem}, DOI={10.1145/3299904.3340311},
booktitle={Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms}, publisher={Association for Computing Machinery}, author={Bossek,
Jakob and Sudholt, Dirk}, year={2019}, pages={102–115}, collection={FOGA ’19}
}'
chicago: 'Bossek, Jakob, and Dirk Sudholt. “Time Complexity Analysis of RLS and
(1 + 1) EA for the Edge Coloring Problem.” In Proceedings of the 15th ACM/SIGEVO
Conference on Foundations of Genetic Algorithms, 102–115. FOGA ’19. New York,
NY, USA: Association for Computing Machinery, 2019. https://doi.org/10.1145/3299904.3340311.'
ieee: 'J. Bossek and D. Sudholt, “Time Complexity Analysis of RLS and (1 + 1) EA
for the Edge Coloring Problem,” in Proceedings of the 15th ACM/SIGEVO Conference
on Foundations of Genetic Algorithms, 2019, pp. 102–115, doi: 10.1145/3299904.3340311.'
mla: Bossek, Jakob, and Dirk Sudholt. “Time Complexity Analysis of RLS and (1 +
1) EA for the Edge Coloring Problem.” Proceedings of the 15th ACM/SIGEVO Conference
on Foundations of Genetic Algorithms, Association for Computing Machinery,
2019, pp. 102–115, doi:10.1145/3299904.3340311.
short: 'J. Bossek, D. Sudholt, in: Proceedings of the 15th ACM/SIGEVO Conference
on Foundations of Genetic Algorithms, Association for Computing Machinery, New
York, NY, USA, 2019, pp. 102–115.'
date_created: 2023-11-14T15:58:56Z
date_updated: 2023-12-13T10:46:12Z
department:
- _id: '819'
doi: 10.1145/3299904.3340311
extern: '1'
keyword:
- edge coloring problem
- runtime analysis
language:
- iso: eng
page: 102–115
place: New York, NY, USA
publication: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms
publication_identifier:
isbn:
- 978-1-4503-6254-2
publication_status: published
publisher: Association for Computing Machinery
series_title: FOGA ’19
status: public
title: Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48875'
abstract:
- lang: eng
text: A multiobjective perspective onto common performance measures such as the
PAR10 score or the expected runtime of single-objective stochastic solvers is
presented by directly investigating the tradeoff between the fraction of failed
runs and the average runtime. Multi-objective indicators operating in the bi-objective
space allow for an overall performance comparison on a set of instances paving
the way for instance-based automated algorithm selection techniques.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Bossek J, Trautmann H. Multi-Objective Performance Measurement: Alternatives
to PAR10 and Expected Running Time. In: Battiti R, Brunato M, Kotsireas I, Pardalos
PM, eds. Learning and Intelligent Optimization. Lecture Notes in Computer
Science. Springer International Publishing; 2019:215–219. doi:10.1007/978-3-030-05348-2_19'
apa: 'Bossek, J., & Trautmann, H. (2019). Multi-Objective Performance Measurement:
Alternatives to PAR10 and Expected Running Time. In R. Battiti, M. Brunato, I.
Kotsireas, & P. M. Pardalos (Eds.), Learning and Intelligent Optimization
(pp. 215–219). Springer International Publishing. https://doi.org/10.1007/978-3-030-05348-2_19'
bibtex: '@inproceedings{Bossek_Trautmann_2019, place={Cham}, series={Lecture Notes
in Computer Science}, title={Multi-Objective Performance Measurement: Alternatives
to PAR10 and Expected Running Time}, DOI={10.1007/978-3-030-05348-2_19},
booktitle={Learning and Intelligent Optimization}, publisher={Springer International
Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Battiti, Roberto
and Brunato, Mauro and Kotsireas, Ilias and Pardalos, Panos M.}, year={2019},
pages={215–219}, collection={Lecture Notes in Computer Science} }'
chicago: 'Bossek, Jakob, and Heike Trautmann. “Multi-Objective Performance Measurement:
Alternatives to PAR10 and Expected Running Time.” In Learning and Intelligent
Optimization, edited by Roberto Battiti, Mauro Brunato, Ilias Kotsireas, and
Panos M. Pardalos, 215–219. Lecture Notes in Computer Science. Cham: Springer
International Publishing, 2019. https://doi.org/10.1007/978-3-030-05348-2_19.'
ieee: 'J. Bossek and H. Trautmann, “Multi-Objective Performance Measurement: Alternatives
to PAR10 and Expected Running Time,” in Learning and Intelligent Optimization,
2019, pp. 215–219, doi: 10.1007/978-3-030-05348-2_19.'
mla: 'Bossek, Jakob, and Heike Trautmann. “Multi-Objective Performance Measurement:
Alternatives to PAR10 and Expected Running Time.” Learning and Intelligent
Optimization, edited by Roberto Battiti et al., Springer International Publishing,
2019, pp. 215–219, doi:10.1007/978-3-030-05348-2_19.'
short: 'J. Bossek, H. Trautmann, in: R. Battiti, M. Brunato, I. Kotsireas, P.M.
Pardalos (Eds.), Learning and Intelligent Optimization, Springer International
Publishing, Cham, 2019, pp. 215–219.'
date_created: 2023-11-14T15:58:57Z
date_updated: 2023-12-13T10:47:32Z
department:
- _id: '819'
doi: 10.1007/978-3-030-05348-2_19
editor:
- first_name: Roberto
full_name: Battiti, Roberto
last_name: Battiti
- first_name: Mauro
full_name: Brunato, Mauro
last_name: Brunato
- first_name: Ilias
full_name: Kotsireas, Ilias
last_name: Kotsireas
- first_name: Panos M.
full_name: Pardalos, Panos M.
last_name: Pardalos
extern: '1'
keyword:
- Algorithm selection
- Performance measurement
language:
- iso: eng
page: 215–219
place: Cham
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-030-05348-2
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: 'Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected
Running Time'
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48877'
abstract:
- lang: eng
text: OpenML is an online machine learning platform where researchers can easily
share data, machine learning tasks and experiments as well as organize them online
to work and collaborate more efficiently. In this paper, we present an R package
to interface with the OpenML platform and illustrate its usage in combination
with the machine learning R package mlr (Bischl et al. J Mach Learn Res 17(170):1—5,
2016). We show how the OpenML package allows R users to easily search, download
and upload data sets and machine learning tasks. Furthermore, we also show how
to upload results of experiments, share them with others and download results
from other users. Beyond ensuring reproducibility of results, the OpenML platform
automates much of the drudge work, speeds up research, facilitates collaboration
and increases the users’ visibility online.
author:
- first_name: Giuseppe
full_name: Casalicchio, Giuseppe
last_name: Casalicchio
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Michel
full_name: Lang, Michel
last_name: Lang
- first_name: Dominik
full_name: Kirchhoff, Dominik
last_name: Kirchhoff
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Benjamin
full_name: Hofner, Benjamin
last_name: Hofner
- first_name: Heidi
full_name: Seibold, Heidi
last_name: Seibold
- first_name: Joaquin
full_name: Vanschoren, Joaquin
last_name: Vanschoren
- first_name: Bernd
full_name: Bischl, Bernd
last_name: Bischl
citation:
ama: 'Casalicchio G, Bossek J, Lang M, et al. OpenML: An R Package to Connect to
the Machine Learning Platform OpenML. Computational Statistics. 2019;34(3):977–991.
doi:10.1007/s00180-017-0742-2'
apa: 'Casalicchio, G., Bossek, J., Lang, M., Kirchhoff, D., Kerschke, P., Hofner,
B., Seibold, H., Vanschoren, J., & Bischl, B. (2019). OpenML: An R Package
to Connect to the Machine Learning Platform OpenML. Computational Statistics,
34(3), 977–991. https://doi.org/10.1007/s00180-017-0742-2'
bibtex: '@article{Casalicchio_Bossek_Lang_Kirchhoff_Kerschke_Hofner_Seibold_Vanschoren_Bischl_2019,
title={OpenML: An R Package to Connect to the Machine Learning Platform OpenML},
volume={34}, DOI={10.1007/s00180-017-0742-2},
number={3}, journal={Computational Statistics}, author={Casalicchio, Giuseppe
and Bossek, Jakob and Lang, Michel and Kirchhoff, Dominik and Kerschke, Pascal
and Hofner, Benjamin and Seibold, Heidi and Vanschoren, Joaquin and Bischl, Bernd},
year={2019}, pages={977–991} }'
chicago: 'Casalicchio, Giuseppe, Jakob Bossek, Michel Lang, Dominik Kirchhoff, Pascal
Kerschke, Benjamin Hofner, Heidi Seibold, Joaquin Vanschoren, and Bernd Bischl.
“OpenML: An R Package to Connect to the Machine Learning Platform OpenML.” Computational
Statistics 34, no. 3 (2019): 977–991. https://doi.org/10.1007/s00180-017-0742-2.'
ieee: 'G. Casalicchio et al., “OpenML: An R Package to Connect to the Machine
Learning Platform OpenML,” Computational Statistics, vol. 34, no. 3, pp.
977–991, 2019, doi: 10.1007/s00180-017-0742-2.'
mla: 'Casalicchio, Giuseppe, et al. “OpenML: An R Package to Connect to the Machine
Learning Platform OpenML.” Computational Statistics, vol. 34, no. 3, 2019,
pp. 977–991, doi:10.1007/s00180-017-0742-2.'
short: G. Casalicchio, J. Bossek, M. Lang, D. Kirchhoff, P. Kerschke, B. Hofner,
H. Seibold, J. Vanschoren, B. Bischl, Computational Statistics 34 (2019) 977–991.
date_created: 2023-11-14T15:58:57Z
date_updated: 2023-12-13T10:51:17Z
department:
- _id: '819'
doi: 10.1007/s00180-017-0742-2
intvolume: ' 34'
issue: '3'
keyword:
- Databases
- Machine learning
- R
- Reproducible research
language:
- iso: eng
page: 977–991
publication: Computational Statistics
publication_identifier:
issn:
- 0943-4062
status: public
title: 'OpenML: An R Package to Connect to the Machine Learning Platform OpenML'
type: journal_article
user_id: '102979'
volume: 34
year: '2019'
...
---
_id: '41032'
author:
- first_name: Bernhard J.
full_name: Gregori, Bernhard J.
last_name: Gregori
- first_name: Felix
full_name: Schwarzhuber, Felix
last_name: Schwarzhuber
- first_name: Simon
full_name: Pöllath, Simon
last_name: Pöllath
- first_name: Josef
full_name: Zweck, Josef
last_name: Zweck
- first_name: Lorena
full_name: Fritsch, Lorena
id: '44418'
last_name: Fritsch
- first_name: Roland
full_name: Schoch, Roland
id: '48467'
last_name: Schoch
orcid: 0000-0003-2061-7289
- first_name: Matthias
full_name: Bauer, Matthias
id: '47241'
last_name: Bauer
orcid: 0000-0002-9294-6076
- first_name: Axel
full_name: Jacobi von Wangelin, Axel
last_name: Jacobi von Wangelin
citation:
ama: Gregori BJ, Schwarzhuber F, Pöllath S, et al. Stereoselective Alkyne Hydrogenation
by using a Simple Iron Catalyst. ChemSusChem. 2019;12(16):3864-3870. doi:10.1002/cssc.201900926
apa: Gregori, B. J., Schwarzhuber, F., Pöllath, S., Zweck, J., Fritsch, L., Schoch,
R., Bauer, M., & Jacobi von Wangelin, A. (2019). Stereoselective Alkyne Hydrogenation
by using a Simple Iron Catalyst. ChemSusChem, 12(16), 3864–3870.
https://doi.org/10.1002/cssc.201900926
bibtex: '@article{Gregori_Schwarzhuber_Pöllath_Zweck_Fritsch_Schoch_Bauer_Jacobi von Wangelin_2019,
title={Stereoselective Alkyne Hydrogenation by using a Simple Iron Catalyst},
volume={12}, DOI={10.1002/cssc.201900926},
number={16}, journal={ChemSusChem}, publisher={Wiley}, author={Gregori, Bernhard
J. and Schwarzhuber, Felix and Pöllath, Simon and Zweck, Josef and Fritsch, Lorena
and Schoch, Roland and Bauer, Matthias and Jacobi von Wangelin, Axel}, year={2019},
pages={3864–3870} }'
chicago: 'Gregori, Bernhard J., Felix Schwarzhuber, Simon Pöllath, Josef Zweck,
Lorena Fritsch, Roland Schoch, Matthias Bauer, and Axel Jacobi von Wangelin. “Stereoselective
Alkyne Hydrogenation by Using a Simple Iron Catalyst.” ChemSusChem 12,
no. 16 (2019): 3864–70. https://doi.org/10.1002/cssc.201900926.'
ieee: 'B. J. Gregori et al., “Stereoselective Alkyne Hydrogenation by using
a Simple Iron Catalyst,” ChemSusChem, vol. 12, no. 16, pp. 3864–3870, 2019,
doi: 10.1002/cssc.201900926.'
mla: Gregori, Bernhard J., et al. “Stereoselective Alkyne Hydrogenation by Using
a Simple Iron Catalyst.” ChemSusChem, vol. 12, no. 16, Wiley, 2019, pp.
3864–70, doi:10.1002/cssc.201900926.
short: B.J. Gregori, F. Schwarzhuber, S. Pöllath, J. Zweck, L. Fritsch, R. Schoch,
M. Bauer, A. Jacobi von Wangelin, ChemSusChem 12 (2019) 3864–3870.
date_created: 2023-01-30T17:56:44Z
date_updated: 2023-12-13T15:12:41Z
department:
- _id: '35'
- _id: '306'
doi: 10.1002/cssc.201900926
intvolume: ' 12'
issue: '16'
keyword:
- General Energy
- General Materials Science
- General Chemical Engineering
- Environmental Chemistry
language:
- iso: eng
page: 3864-3870
publication: ChemSusChem
publication_identifier:
issn:
- 1864-5631
- 1864-564X
publication_status: published
publisher: Wiley
status: public
title: Stereoselective Alkyne Hydrogenation by using a Simple Iron Catalyst
type: journal_article
user_id: '44418'
volume: 12
year: '2019'
...
---
_id: '49614'
author:
- first_name: Swen
full_name: Schulte Eickholt, Swen
id: '7117'
last_name: Schulte Eickholt
- first_name: Michael
full_name: Hofmann, Michael
last_name: Hofmann
- first_name: Klaus
full_name: von Stosch, Klaus
last_name: von Stosch
citation:
ama: Schulte Eickholt S, Hofmann M, von Stosch K. Navid Kermani.; 2019.
apa: Schulte Eickholt, S., Hofmann, M., & von Stosch, K. (2019). Navid Kermani.
bibtex: '@book{Schulte Eickholt_Hofmann_von Stosch_2019, place={Würzburg}, title={Navid
Kermani}, author={Schulte Eickholt, Swen and Hofmann, Michael and von Stosch,
Klaus}, year={2019} }'
chicago: Schulte Eickholt, Swen, Michael Hofmann, and Klaus von Stosch. Navid
Kermani. Würzburg, 2019.
ieee: S. Schulte Eickholt, M. Hofmann, and K. von Stosch, Navid Kermani.
Würzburg, 2019.
mla: Schulte Eickholt, Swen, et al. Navid Kermani. 2019.
short: S. Schulte Eickholt, M. Hofmann, K. von Stosch, Navid Kermani, Würzburg,
2019.
date_created: 2023-12-14T09:41:02Z
date_updated: 2023-12-14T09:49:15Z
language:
- iso: eng
place: Würzburg
status: public
title: Navid Kermani
type: book
user_id: '7117'
year: '2019'
...
---
_id: '49712'
author:
- first_name: Stefan
full_name: Elit, Stefan
id: '105'
last_name: Elit
orcid: 0000-0002-4719-1073
- first_name: Norbert Otto
full_name: Eke, Norbert Otto
id: '104'
last_name: Eke
citation:
ama: 'Elit S, Eke NO. Einleitung. In: Elit S, Eke NO, eds. Literarische Institutionen.
Grundthemen der Literaturwissenschaft. de Gruyter; 2019:1-17.'
apa: Elit, S., & Eke, N. O. (2019). Einleitung. In S. Elit & N. O. Eke (Eds.),
Literarische Institutionen (pp. 1–17). de Gruyter.
bibtex: '@inbook{Elit_Eke_2019, place={Berlin/Boston}, series={Grundthemen der Literaturwissenschaft},
title={Einleitung}, booktitle={Literarische Institutionen}, publisher={de Gruyter},
author={Elit, Stefan and Eke, Norbert Otto}, editor={Elit, Stefan and Eke, Norbert
Otto}, year={2019}, pages={1–17}, collection={Grundthemen der Literaturwissenschaft}
}'
chicago: 'Elit, Stefan, and Norbert Otto Eke. “Einleitung.” In Literarische Institutionen,
edited by Stefan Elit and Norbert Otto Eke, 1–17. Grundthemen der Literaturwissenschaft.
Berlin/Boston: de Gruyter, 2019.'
ieee: 'S. Elit and N. O. Eke, “Einleitung,” in Literarische Institutionen,
S. Elit and N. O. Eke, Eds. Berlin/Boston: de Gruyter, 2019, pp. 1–17.'
mla: Elit, Stefan, and Norbert Otto Eke. “Einleitung.” Literarische Institutionen,
edited by Stefan Elit and Norbert Otto Eke, de Gruyter, 2019, pp. 1–17.
short: 'S. Elit, N.O. Eke, in: S. Elit, N.O. Eke (Eds.), Literarische Institutionen,
de Gruyter, Berlin/Boston, 2019, pp. 1–17.'
date_created: 2023-12-15T14:02:51Z
date_updated: 2023-12-15T14:02:56Z
department:
- _id: '465'
- _id: '5'
editor:
- first_name: Stefan
full_name: Elit, Stefan
last_name: Elit
- first_name: Norbert Otto
full_name: Eke, Norbert Otto
last_name: Eke
language:
- iso: ger
page: 1-17
place: Berlin/Boston
publication: Literarische Institutionen
publication_identifier:
isbn:
- 978-3-11-036469-9
publication_status: published
publisher: de Gruyter
series_title: Grundthemen der Literaturwissenschaft
status: public
title: Einleitung
type: book_chapter
user_id: '105'
year: '2019'
...
---
_id: '49747'
author:
- first_name: Yves
full_name: Huybrechts, Yves
id: '78579'
last_name: Huybrechts
orcid: 0009-0009-2166-9794
citation:
ama: Huybrechts Y. Die Antwerpener Börse - Aufstieg, Niedergang und Wandel (VIDEO).
BelgienNet; 2019.
apa: Huybrechts, Y. (2019). Die Antwerpener Börse - Aufstieg, Niedergang und
Wandel (VIDEO). BelgienNet.
bibtex: '@book{Huybrechts_2019, title={Die Antwerpener Börse - Aufstieg, Niedergang
und Wandel (VIDEO)}, publisher={BelgienNet}, author={Huybrechts, Yves}, year={2019}
}'
chicago: Huybrechts, Yves. Die Antwerpener Börse - Aufstieg, Niedergang und Wandel
(VIDEO). BelgienNet, 2019.
ieee: Y. Huybrechts, Die Antwerpener Börse - Aufstieg, Niedergang und Wandel
(VIDEO). BelgienNet, 2019.
mla: Huybrechts, Yves. Die Antwerpener Börse - Aufstieg, Niedergang und Wandel
(VIDEO). BelgienNet, 2019.
short: Y. Huybrechts, Die Antwerpener Börse - Aufstieg, Niedergang und Wandel (VIDEO),
BelgienNet, 2019.
date_created: 2023-12-18T09:38:41Z
date_updated: 2023-12-18T10:09:20Z
department:
- _id: '448'
language:
- iso: ger
main_file_link:
- open_access: '1'
url: https://belgien.net/antwerpener-boerse/
oa: '1'
publication_status: published
publisher: BelgienNet
status: public
title: Die Antwerpener Börse - Aufstieg, Niedergang und Wandel (VIDEO)
type: misc
user_id: '78579'
year: '2019'
...
---
_id: '49834'
author:
- first_name: Alena
full_name: Diedrich, Alena
id: '49513'
last_name: Diedrich
citation:
ama: 'Diedrich A. Ironische Wendigkeit und poetische Notwendigkeit. Zum Begriff
des ,Scheiterns‘ bei Hans Magnus Enzensberger. In: Bartl A, Erk C, Klinge A, Kraus
M, eds. Verhinderte Meisterwerke. Gescheiterte Projekte in Literatur Und Film.
; 2019.'
apa: Diedrich, A. (2019). Ironische Wendigkeit und poetische Notwendigkeit. Zum
Begriff des ,Scheiterns‘ bei Hans Magnus Enzensberger. In A. Bartl, C. Erk, A.
Klinge, & M. Kraus (Eds.), Verhinderte Meisterwerke. Gescheiterte Projekte
in Literatur und Film.
bibtex: '@inbook{Diedrich_2019, title={Ironische Wendigkeit und poetische Notwendigkeit.
Zum Begriff des ,Scheiterns‘ bei Hans Magnus Enzensberger}, booktitle={Verhinderte
Meisterwerke. Gescheiterte Projekte in Literatur und Film}, author={Diedrich,
Alena}, editor={Bartl, Andrea and Erk, Corina and Klinge, Annika and Kraus,
Martin}, year={2019} }'
chicago: Diedrich, Alena. “Ironische Wendigkeit Und Poetische Notwendigkeit. Zum
Begriff Des ,Scheiterns‘ Bei Hans Magnus Enzensberger.” In Verhinderte Meisterwerke.
Gescheiterte Projekte in Literatur Und Film, edited by Andrea Bartl, Corina Erk,
Annika Klinge, and Martin Kraus, 2019.
ieee: A. Diedrich, “Ironische Wendigkeit und poetische Notwendigkeit. Zum Begriff
des ,Scheiterns‘ bei Hans Magnus Enzensberger,” in Verhinderte Meisterwerke.
Gescheiterte Projekte in Literatur und Film, A. Bartl, C. Erk, A. Klinge,
and M. Kraus, Eds. 2019.
mla: Diedrich, Alena. “Ironische Wendigkeit Und Poetische Notwendigkeit. Zum Begriff
Des ,Scheiterns‘ Bei Hans Magnus Enzensberger.” Verhinderte Meisterwerke. Gescheiterte
Projekte in Literatur Und Film, edited by Andrea Bartl et al., 2019.
short: 'A. Diedrich, in: A. Bartl, C. Erk, A. Klinge, M. Kraus (Eds.), Verhinderte
Meisterwerke. Gescheiterte Projekte in Literatur Und Film, 2019.'
date_created: 2023-12-19T09:00:06Z
date_updated: 2023-12-19T09:05:40Z
editor:
- first_name: Andrea
full_name: Bartl, Andrea
last_name: Bartl
- first_name: 'Corina '
full_name: 'Erk, Corina '
last_name: Erk
- first_name: 'Annika '
full_name: 'Klinge, Annika '
last_name: Klinge
- first_name: Martin
full_name: Kraus, Martin
last_name: Kraus
language:
- iso: eng
publication: Verhinderte Meisterwerke. Gescheiterte Projekte in Literatur und Film
status: public
title: Ironische Wendigkeit und poetische Notwendigkeit. Zum Begriff des ,Scheiterns‘
bei Hans Magnus Enzensberger
type: book_chapter
user_id: '49513'
year: '2019'
...