The following pages link to Thomas Stützle (Q296692):
Displaying 50 items.
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
- (Q319098) (redirect page) (← links)
- Anytime Pareto local search (Q319099) (← links)
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (Q336931) (← links)
- Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools (Q337131) (← links)
- A destroy and repair algorithm for the bike sharing rebalancing problem (Q342356) (← links)
- (Q408981) (redirect page) (← links)
- Improving the anytime behavior of two-phase local search (Q408982) (← links)
- (Q497452) (redirect page) (← links)
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
- A review of metrics on permutations for search landscape analysis (Q878593) (← links)
- Estimation-based metaheuristics for the probabilistic traveling salesman problem (Q976010) (← links)
- Shifting representation search for hybrid flexible flowline problems (Q992723) (← links)
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem (Q1042104) (← links)
- Local search algorithms for SAT: an empirical evaluation (Q1581848) (← links)
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT (Q1606317) (← links)
- Effect of transformations of numerical parameters in automatic algorithm configuration (Q1634780) (← links)
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (Q1652233) (← links)
- Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem (Q1676480) (← links)
- Exploring variable neighborhood search for automatic algorithm configuration (Q1687671) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- Large neighbourhood search algorithms for the founder sequence reconstruction problem (Q1761968) (← links)
- The linear ordering problem: instances, search space analysis and algorithms (Q1774626) (← links)
- An analysis of why cuckoo search does not bring any novel ideas to optimization (Q2147006) (← links)
- A landscape-based analysis of fixed temperature and simulated annealing (Q2171587) (← links)
- Matheuristics. Algorithms and implementations (Q2246150) (← links)
- Automatically improving the anytime behaviour of optimisation algorithms (Q2256321) (← links)
- Automatic algorithm design for hybrid flowshop scheduling problems (Q2286868) (← links)
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
- The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611) (← links)
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives (Q2467260) (← links)
- On local optima in multiobjective combinatorial optimization problems (Q2468765) (← links)
- Iterated local search for the quadratic assignment problem (Q2503224) (← links)
- Hybrid population-based algorithms for the bi-objective quadratic assignment problem (Q2506218) (← links)
- A unified ant colony optimization algorithm for continuous optimization (Q2514761) (← links)
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices (Q2572862) (← links)
- (Q2726296) (← links)
- (Q2749854) (← links)
- (Q2749862) (← links)
- (Q2770544) (← links)
- (Q2776576) (← links)
- Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem (Q2901040) (← links)
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
- Exploratory Analysis of Stochastic Local Search Algorithms in Biobjective Optimization (Q3064521) (← links)
- (Q3064527) (← links)
- MADS/F-Race: Mesh Adaptive Direct Search Meets F-Race (Q3082799) (← links)
