default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErik Orm Hellsten
Person information
- affiliation: Technical University of Denmark, Lyngby, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c4]Carl Hvarfner, Erik Orm Hellsten, Luigi Nardi:
Vanilla Bayesian Optimization Performs Great in High Dimensions. ICML 2024- [c3]Jonathan Styrud, Matthias Mayr, Erik Hellsten, Volker Krüger, Christian Smith:
BeBOP - Combining Reactive Planning and Bayesian Optimization to Solve Robotic Manipulation Tasks. ICRA 2024: 16459-16466 - [i5]Carl Hvarfner, Erik Orm Hellsten, Luigi Nardi:
Vanilla Bayesian Optimization Performs Great in High Dimensions. CoRR abs/2402.02229 (2024) - 2023
- [c2]Erik Orm Hellsten
, Artur L. F. Souza, Johannes Lenfers, Rubens Lacouture, Olivia Hsu, Adel Ejjeh, Fredrik Kjolstad, Michel Steuwer, Kunle Olukotun, Luigi Nardi:
BaCO: A Fast and Portable Bayesian Compiler Optimization Framework. ASPLOS (4) 2023: 19-42 - [c1]Carl Hvarfner, Erik Hellsten, Frank Hutter, Luigi Nardi:
Self-Correcting Bayesian Optimization through Bayesian Active Learning. NeurIPS 2023 - [i4]Carl Hvarfner, Erik Hellsten, Frank Hutter, Luigi Nardi:
Self-Correcting Bayesian Optimization through Bayesian Active Learning. CoRR abs/2304.11005 (2023) - [i3]Jonathan Styrud, Matthias Mayr, Erik Hellsten, Volker Krüger, Christian Smith:
BeBOP - Combining Reactive Planning and Bayesian Optimization to Solve Robotic Manipulation Tasks. CoRR abs/2310.00971 (2023) - [i2]Erik Orm Hellsten, Carl Hvarfner, Leonard Papenmeier, Luigi Nardi:
High-dimensional Bayesian Optimization with Group Testing. CoRR abs/2310.03515 (2023) - 2022
- [j4]Erik Orm Hellsten, David Sacramento, David Pisinger:
A branch-and-price algorithm for solving the single-hub feeder network design problem. Eur. J. Oper. Res. 300(3): 902-916 (2022) - [i1]Erik Hellsten, Artur L. F. Souza, Johannes Lenfers, Rubens Lacouture, Olivia Hsu, Adel Ejjeh, Fredrik Kjolstad, Michel Steuwer, Kunle Olukotun, Luigi Nardi:
BaCO: A Fast and Portable Bayesian Compiler Optimization Framework. CoRR abs/2212.11142 (2022) - 2021
- [j3]Erik Orm Hellsten, David Franz Koza, Iván A. Contreras, Jean-François Cordeau, David Pisinger:
The transit time constrained fixed charge multi-commodity network design problem. Comput. Oper. Res. 136: 105511 (2021) - 2020
- [j2]Marielle Christiansen, Erik Orm Hellsten, David Pisinger, David Sacramento, Charlotte Vilhelmsen:
Liner shipping network design. Eur. J. Oper. Res. 286(1): 1-20 (2020) - [j1]Erik Orm Hellsten, David Sacramento, David Pisinger:
An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports. Eur. J. Oper. Res. 287(2): 682-698 (2020)
Coauthor Index
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-04 00:31 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:
