| Publication | Date of Publication | Type |
|---|
On the automatic generation of metaheuristic algorithms for combinatorial optimization problems European Journal of Operational Research | 2025-05-16 | Paper |
| A study of scalarisation techniques for multi-objective QUBO solving | 2024-09-17 | Paper |
| Autoconfig: Vehicle Routing Problem with Occasional Drivers | 2024-02-15 | Dataset |
| Autoconfig: Balanced Minimum sum-of-squares clustering case | 2024-02-15 | Dataset |
| Decision Diagrams in Space! | 2023-12-03 | Paper |
| eaf | 2023-11-28 | Software |
| iraceplot | 2023-06-10 | Software |
| irace | 2022-10-23 | Software |
| A Study of Scalarisation Techniques for Multi-Objective QUBO Solving | 2022-10-20 | Paper |
| Detection of Hidden Objectives and Interactive Objective Reduction | 2022-06-02 | Paper |
| The Asteroid Routing Problem: A Benchmark for Expensive Black-Box Permutation Optimization | 2022-03-29 | Paper |
| Analyzing the Impact of Undersampling on the Benchmarkingand Configuration of Evolutionary Algorithms - Dataset | 2022-01-31 | Dataset |
Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms European Journal of Operational Research | 2021-06-03 | Paper |
Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization Computers & Operations Research | 2016-11-17 | Paper |
Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools Computers & Operations Research | 2016-11-10 | Paper |
Anytime Pareto local search European Journal of Operational Research | 2016-10-06 | Paper |
The irace package: Iterated racing for automatic algorithm configuration Operations Research Perspectives | 2016-01-01 | Paper |
Automatically improving the anytime behaviour of optimisation algorithms European Journal of Operational Research | 2015-02-19 | Paper |
Pareto local search algorithms for anytime bi-objective optimization Evolutionary Computation in Combinatorial Optimization | 2012-10-18 | Paper |
Improving the anytime behavior of two-phase local search Annals of Mathematics and Artificial Intelligence | 2012-04-12 | Paper |
A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems Computers & Operations Research | 2011-03-25 | Paper |
Exploratory analysis of stochastic local search algorithms in biobjective optimization Experimental Methods for the Analysis of Optimization Algorithms | 2010-12-22 | Paper |
Beam-ACO for the travelling salesman problem with time windows Computers & Operations Research | 2010-03-18 | Paper |
Beam search for the longest common subsequence problem Computers & Operations Research | 2009-08-14 | Paper |
| Using experimental design to analyze stochastic local search algorithms for multiobjectve problems | 2008-06-03 | Paper |
Hybrid population-based algorithms for the bi-objective quadratic assignment problem JMMA. Journal of Mathematical Modelling and Algorithms | 2006-09-28 | Paper |