Thomas Stützle

From MaRDI portal
Person:296692

Available identifiers

zbMath Open stutzle.thomas-gDBLP61/6836WikidataQ56524110 ScholiaQ56524110MaRDI QIDQ296692

List of research outcomes





PublicationDate of PublicationType
Autoconfig: Balanced Minimum sum-of-squares clustering case2024-02-15Dataset
Autoconfig: Vehicle Routing Problem with Occasional Drivers2024-02-15Dataset
Evaluating the impact of grammar complexity in automatic algorithm design2023-11-29Paper
Exposing the grey wolf, moth‐flame, whale, firefly, bat, and antlion algorithms: six misleading optimization techniques inspired by bestial metaphors2023-10-04Paper
A landscape-based analysis of fixed temperature and simulated annealing2022-09-09Paper
An analysis of why cuckoo search does not bring any novel ideas to optimization2022-06-22Paper
Matheuristics. Algorithms and implementations2021-11-15Paper
Automatic algorithm design for hybrid flowshop scheduling problems2020-01-23Paper
Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems2019-03-12Paper
Revisiting simulated annealing: a component-based analysis2019-02-14Paper
Effect of transformations of numerical parameters in automatic algorithm configuration2018-12-18Paper
An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem2018-07-11Paper
Exploring variable neighborhood search for automatic algorithm configuration2018-01-04Paper
Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem2017-11-09Paper
A destroy and repair algorithm for the bike sharing rebalancing problem2016-11-17Paper
Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances2016-11-10Paper
Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools2016-11-10Paper
Anytime Pareto local search2016-10-06Paper
On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem2016-06-23Paper
Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems2015-10-09Paper
On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances2015-09-24Paper
Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers2015-06-25Paper
Automatically improving the anytime behaviour of optimisation algorithms2015-02-19Paper
A unified ant colony optimization algorithm for continuous optimization2015-02-03Paper
An analysis of parameter adaptation in reactive tabu search2014-06-20Paper
Large neighbourhood search algorithms for the founder sequence reconstruction problem2012-11-15Paper
Pareto Local Search Algorithms for Anytime Bi-objective Optimization2012-10-18Paper
Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem2012-07-28Paper
Improving the anytime behavior of two-phase local search2012-04-12Paper
A Bi-objective Optimization Model to Eliciting Decision Maker’s Preferences for the PROMETHEE II Method2011-10-28Paper
A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems2011-03-25Paper
MADS/F-Race: Mesh Adaptive Direct Search Meets F-Race2011-03-16Paper
https://portal.mardi4nfdi.de/entity/Q30645272010-12-22Paper
Exploratory Analysis of Stochastic Local Search Algorithms in Biobjective Optimization2010-12-22Paper
Shifting representation search for hybrid flexible flowline problems2010-09-09Paper
Estimation-based metaheuristics for the probabilistic traveling salesman problem2010-06-11Paper
On the Performance of Local Search for the Biobjective Traveling Salesman Problem2010-05-28Paper
ParamILS: An Automatic Algorithm Configuration Framework2009-12-10Paper
Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem2009-12-07Paper
Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis2009-12-04Paper
Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem2009-05-07Paper
Evolutionary Computation in Combinatorial Optimization2009-05-05Paper
Design and analysis of stochastic local search for the multiobjective traveling salesman problem2009-04-03Paper
Using experimental design to analyze stochastic local search algorithms for multiobjectve problems2008-06-03Paper
On local optima in multiobjective combinatorial optimization problems2008-01-25Paper
An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives2008-01-21Paper
The quadratic three-dimensional assignment problem: exact and approximate solution methods2007-10-10Paper
A review of metrics on permutations for search landscape analysis2007-04-26Paper
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem2006-12-14Paper
Hybrid population-based algorithms for the bi-objective quadratic assignment problem2006-09-28Paper
Iterated local search for the quadratic assignment problem2006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54800992006-07-25Paper
https://portal.mardi4nfdi.de/entity/Q54723872006-06-12Paper
A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices2005-11-04Paper
The linear ordering problem: instances, search space analysis and algorithms2005-05-17Paper
https://portal.mardi4nfdi.de/entity/Q48174082004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q44720252004-08-03Paper
https://portal.mardi4nfdi.de/entity/Q44720352004-08-03Paper
https://portal.mardi4nfdi.de/entity/Q44529002004-03-07Paper
The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances2004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44243212003-09-04Paper
https://portal.mardi4nfdi.de/entity/Q44183922003-08-10Paper
https://portal.mardi4nfdi.de/entity/Q44183812003-08-10Paper
https://portal.mardi4nfdi.de/entity/Q44156992003-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44157032003-08-06Paper
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT2002-07-24Paper
https://portal.mardi4nfdi.de/entity/Q27705442002-02-13Paper
Analysing the run-time behaviour of iterated local search for the travelling salesman problem.2002-01-01Paper
SATLIB: An online resource for research on SAT2001-12-03Paper
https://portal.mardi4nfdi.de/entity/Q49346342001-11-16Paper
Local search algorithms for SAT: an empirical evaluation2001-10-21Paper
Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)2001-07-17Paper
Local search algorithms for SAT: an empirical evaluation2000-10-10Paper
https://portal.mardi4nfdi.de/entity/Q44951932000-08-10Paper

Research outcomes over time

This page was built for person: Thomas Stützle