Erik Orm Hellsten

Orcid: 0000-0003-0933-3349

Affiliations:
  • Technical University of Denmark, Lyngby, Denmark


According to our database1, Erik Orm Hellsten authored at least 9 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Vanilla Bayesian Optimization Performs Great in High Dimensions.
CoRR, 2024

2023
High-dimensional Bayesian Optimization with Group Testing.
CoRR, 2023

BeBOP - Combining Reactive Planning and Bayesian Optimization to Solve Robotic Manipulation Tasks.
CoRR, 2023

Self-Correcting Bayesian Optimization through Bayesian Active Learning.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

BaCO: A Fast and Portable Bayesian Compiler Optimization Framework.
Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2023

2022
A branch-and-price algorithm for solving the single-hub feeder network design problem.
Eur. J. Oper. Res., 2022

2021
The transit time constrained fixed charge multi-commodity network design problem.
Comput. Oper. Res., 2021

2020
An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports.
Eur. J. Oper. Res., 2020

Liner shipping network design.
Eur. J. Oper. Res., 2020


  Loading...