output
20142025
most citedEnergy Efficient Scheduling and Routing via Randomized Rounding

42 citations

21 papers

cond-mat.mtrl-sci2025

Modeling of silver transport in cubic SiC: Integrating molecular dynamics, bounds averaging, and uncertainty quantification

Mohamed AbdulHameed, Khadija Mahbuba, Mahmoud Yaseen +3

Silver released from TRISO fuel particles can migrate through the SiC layer and deposit on reactor components, posing radiation hazards and operational challenges. Despite numerous…

physics.soc-ph2024★ 5 cited

Misaligned incentives in sports: A mathematical analysis of the post-2024 UEFA Champions League qualification

László Csató, Sergey Ilyin

UEFA declares that it is committed to respecting the fundamental values of sports. However, the qualification rules of the post-2024 UEFA Champions League are shown to be unfair: a…

cs.LG2023★ 1 cited

PS-AAS: Portfolio Selection for Automated Algorithm Selection in Black-Box Optimization

Ana Kostovska, Gjorgjina Cenikj, Diederick Vermetten +6

The performance of automated algorithm selection (AAS) strongly depends on the portfolio of algorithms to choose from. Selecting the portfolio is a non-trivial task that requires b…

cs.LG2023★ 1 cited

Self-Adjusting Weighted Expected Improvement for Bayesian Optimization

Carolin Benjamins, Elena Raponi, Anja Jankovic +2

Bayesian Optimization (BO) is a class of surrogate-based, sample-efficient algorithms for optimizing black-box problems with small evaluation budgets. The BO pipeline itself is hig…

cs.LG2023★ 2 cited

MA-BBOB: Many-Affine Combinations of BBOB Functions for Evaluating AutoML Approaches in Noiseless Numerical Black-Box Optimization Contexts

Diederick Vermetten, Furong Ye, Thomas Bäck +1

Extending a recent suggestion to generate new instances for numerical black-box optimization benchmarking by interpolating pairs of the well-established BBOB functions from the COm…

cs.DS2022★ 16 cited

On the Fixed-Parameter Tractability of Capacitated Clustering

Vincent Cohen-Addad, Jason Li

We study the complexity of the classic capacitated k-median and k-means problems parameterized by the number of centers, k. These problems are notoriously difficult since the best…