default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHeike Trautmann
- > Home > Persons > Heike Trautmann
Publications
- 2023
[j26]Jonathan Heins
, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann, Pascal Kerschke:
A study on the effects of normalized TSP features for automated algorithm selection. Theor. Comput. Sci. 940(Part): 123-145 (2023)- [c84]Moritz Vinzent Seiler, Jeroen Rook, Jonathan Heins, Oliver Ludger Preuß, Jakob Bossek, Heike Trautmann:
Using Reinforcement Learning for Per-Instance Algorithm Configuration on the TSP. SSCI 2023: 361-368 - 2022
- [c82]Jeroen Rook, Heike Trautmann, Jakob Bossek, Christian Grimme:
On the potential of automated algorithm configuration on multi-modal multi-objective optimization problems. GECCO Companion 2022: 356-359 - [c78]Jonathan Heins, Jeroen Rook, Lennart Schäpermeier, Pascal Kerschke, Jakob Bossek, Heike Trautmann:
BBE: Basin-Based Evaluation of Multimodal Multi-objective Optimization Problems. PPSN (1) 2022: 192-206 - 2021
- [c75]Jonathan Heins, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann, Pascal Kerschke:
On the potential of normalized TSP features for automated algorithm selection. FOGA 2021: 7:1-7:15 - 2020
- [j19]Jakob Bossek, Pascal Kerschke, Heike Trautmann:
A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms. Appl. Soft Comput. 88: 105901 (2020) - [c72]Jakob Bossek, Christian Grimme, Günter Rudolph, Heike Trautmann:
Towards Decision Support in Dynamic Bi-Objective Vehicle Routing. CEC 2020: 1-8 - [c71]Jakob Bossek, Pascal Kerschke, Heike Trautmann:
Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection. CEC 2020: 1-8 - [c69]Jakob Bossek, Christian Grimme, Heike Trautmann:
Dynamic bi-objective routing of multiple vehicles. GECCO 2020: 166-174 - [c64]Moritz Seiler, Janina Pohl, Jakob Bossek, Pascal Kerschke, Heike Trautmann:
Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem. PPSN (1) 2020: 48-64 - [i15]Jakob Bossek, Pascal Kerschke, Heike Trautmann:
Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection. CoRR abs/2005.13289 (2020) - [i13]Jakob Bossek, Christian Grimme, Günter Rudolph, Heike Trautmann:
Towards Decision Support in Dynamic Bi-Objective Vehicle Routing. CoRR abs/2005.13865 (2020) - [i12]Jakob Bossek, Christian Grimme, Heike Trautmann:
Dynamic Bi-Objective Routing of Multiple Vehicles. CoRR abs/2005.13872 (2020) - [i11]Moritz Seiler, Janina Pohl, Jakob Bossek, Pascal Kerschke, Heike Trautmann:
Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem. CoRR abs/2006.15968 (2020) - 2019
- [c60]Jakob Bossek, Christian Grimme, Stephan Meisel, Günter Rudolph, Heike Trautmann:
Bi-objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm. EMO 2019: 516-528 - [c59]Jakob Bossek, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann, Heike Trautmann:
Evolving diverse TSP instances by means of novel and creative mutation operators. FOGA 2019: 58-71 - 2018
- [j12]Pascal Kerschke, Lars Kotthoff, Jakob Bossek, Holger H. Hoos, Heike Trautmann:
Leveraging TSP Solver Complementarity through Machine Learning. Evol. Comput. 26(4) (2018) - [c53]Jakob Bossek, Christian Grimme, Stephan Meisel, Günter Rudolph, Heike Trautmann:
Local search effects in bi-objective orienteering. GECCO 2018: 585-592 - [c52]Pascal Kerschke, Jakob Bossek, Heike Trautmann:
Parameterization of state-of-the-art performance indicators: a robustness study based on inexact TSP solvers. GECCO (Companion) 2018: 1737-1744 - [c51]Jakob Bossek, Heike Trautmann:
Multi-objective Performance Measurement: Alternatives to PAR10 and Expected Running Time. LION 2018: 215-219 - 2016
- [c43]Jakob Bossek, Heike Trautmann:
Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference. AI*IA 2016: 3-12 - [c38]Jakob Bossek, Heike Trautmann:
Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers. LION 2016: 48-59 - 2015
- [c32]Stephan Meisel, Christian Grimme, Jakob Bossek, Martin Wölck, Günter Rudolph, Heike Trautmann:
Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic Routing of a Vehicle. GECCO 2015: 425-432 - 2013
- [j5]Olaf Mersmann, Bernd Bischl, Heike Trautmann, Markus Wagner, Jakob Bossek, Frank Neumann:
A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem. Ann. Math. Artif. Intell. 69(2): 151-182 (2013) - 2012
- [c15]Olaf Mersmann, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner, Frank Neumann:
Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. LION 2012: 115-129
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
