| Publication | Date of Publication | Type |
|---|
| Evaluating the impact of grammar complexity in automatic algorithm design | 2023-11-29 | Paper |
| Exposing the grey wolf, moth‐flame, whale, firefly, bat, and antlion algorithms: six misleading optimization techniques inspired by bestial metaphors | 2023-10-04 | Paper |
| A landscape-based analysis of fixed temperature and simulated annealing | 2022-09-09 | Paper |
| An analysis of why cuckoo search does not bring any novel ideas to optimization | 2022-06-22 | Paper |
| Matheuristics. Algorithms and implementations | 2021-11-15 | Paper |
| Automatic algorithm design for hybrid flowshop scheduling problems | 2020-01-23 | Paper |
| Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems | 2019-03-12 | Paper |
| Revisiting simulated annealing: a component-based analysis | 2019-02-14 | Paper |
| Effect of transformations of numerical parameters in automatic algorithm configuration | 2018-12-18 | Paper |
| An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem | 2018-07-11 | Paper |
| Exploring variable neighborhood search for automatic algorithm configuration | 2018-01-04 | Paper |
| Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem | 2017-11-09 | Paper |
| A destroy and repair algorithm for the bike sharing rebalancing problem | 2016-11-17 | Paper |
| Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances | 2016-11-10 | Paper |
| Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools | 2016-11-10 | Paper |
| Anytime Pareto local search | 2016-10-06 | Paper |
| On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem | 2016-06-23 | Paper |
| Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems | 2015-10-09 | Paper |
| On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances | 2015-09-24 | Paper |
| Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers | 2015-06-25 | Paper |
| Automatically improving the anytime behaviour of optimisation algorithms | 2015-02-19 | Paper |
| A unified ant colony optimization algorithm for continuous optimization | 2015-02-03 | Paper |
| An analysis of parameter adaptation in reactive tabu search | 2014-06-20 | Paper |
| Large neighbourhood search algorithms for the founder sequence reconstruction problem | 2012-11-15 | Paper |
| Pareto Local Search Algorithms for Anytime Bi-objective Optimization | 2012-10-18 | Paper |
| Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem | 2012-07-28 | Paper |
| Improving the anytime behavior of two-phase local search | 2012-04-12 | Paper |
| A Bi-objective Optimization Model to Eliciting Decision Maker’s Preferences for the PROMETHEE II Method | 2011-10-28 | Paper |
| A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems | 2011-03-25 | Paper |
| MADS/F-Race: Mesh Adaptive Direct Search Meets F-Race | 2011-03-16 | Paper |
| Exploratory Analysis of Stochastic Local Search Algorithms in Biobjective Optimization | 2010-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3064527 | 2010-12-22 | Paper |
| Shifting representation search for hybrid flexible flowline problems | 2010-09-09 | Paper |
| Estimation-based metaheuristics for the probabilistic traveling salesman problem | 2010-06-11 | Paper |
| On the Performance of Local Search for the Biobjective Traveling Salesman Problem | 2010-05-28 | Paper |
| ParamILS: An Automatic Algorithm Configuration Framework | 2009-12-10 | Paper |
| Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem | 2009-12-07 | Paper |
| Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis | 2009-12-04 | Paper |
| Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem | 2009-05-07 | Paper |
| Evolutionary Computation in Combinatorial Optimization | 2009-05-05 | Paper |
| Design and analysis of stochastic local search for the multiobjective traveling salesman problem | 2009-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3500163 | 2008-06-03 | Paper |
| On local optima in multiobjective combinatorial optimization problems | 2008-01-25 | Paper |
| An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives | 2008-01-21 | Paper |
| The quadratic three-dimensional assignment problem: exact and approximate solution methods | 2007-10-10 | Paper |
| A review of metrics on permutations for search landscape analysis | 2007-04-26 | Paper |
| A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem | 2006-12-14 | Paper |
| Hybrid population-based algorithms for the bi-objective quadratic assignment problem | 2006-09-28 | Paper |
| Iterated local search for the quadratic assignment problem | 2006-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5480099 | 2006-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5472387 | 2006-06-12 | Paper |
| A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices | 2005-11-04 | Paper |
| The linear ordering problem: instances, search space analysis and algorithms | 2005-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817408 | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472025 | 2004-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472035 | 2004-08-03 | Paper |
| The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452900 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4424321 | 2003-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418381 | 2003-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418392 | 2003-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415699 | 2003-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415703 | 2003-08-06 | Paper |
| Towards a characterisation of the behaviour of stochastic local search algorithms for SAT | 2002-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2770544 | 2002-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776576 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2749862 | 2001-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934634 | 2001-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2749854 | 2001-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2726296 | 2001-07-17 | Paper |
| Local search algorithms for SAT: an empirical evaluation | 2000-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495193 | 2000-08-10 | Paper |
