A causal framework for stochastic local search optimization algorithms

Cites work

scientific article; zbMATH DE number 4048925 (Why is no real title available?)
scientific article; zbMATH DE number 3497315 (Why is no real title available?)
scientific article; zbMATH DE number 2050711 (Why is no real title available?)
scientific article; zbMATH DE number 2065615 (Why is no real title available?)
scientific article; zbMATH DE number 5686753 (Why is no real title available?)
A Survey of Methods for Automated Algorithm Configuration
A comprehensive review and evaluation of permutation flowshop heuristics
A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
A landscape-based analysis of fixed temperature and simulated annealing
A multilevel evaluation method for heuristics with an application to the VRPTW
A theoretical framework for simulated annealing
A thermodynamically motivated simulation procedure for combinatorial optimization problems
An improved annealing scheme for the QAP
Automata, Languages and Programming
Automated Dynamic Algorithm Configuration
Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
Black-box complexities of combinatorial problems
Black-box search by unbiased variation
Causality. Models, reasoning, and inference
Computing in combinatorial optimization
Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
Designing and reporting on computational experiments with heuristic methods
Elements of causal inference. Foundations and learning algorithms
From black-box complexity to designing new genetic algorithms
Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools
Handbook of heuristics
Handbook of metaheuristics
How to analyse evolutionary algorithms.
Improved time complexity analysis of the simple genetic algorithm
Knowledge-guided local search for the vehicle routing problem
Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
Multiplicative drift analysis
Needed: An Empirical Science of Algorithms
On the convergence of generalized hill climbing algorithms
On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
Optimal parameter choices via precise black-box analysis
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
Optimization by simulated annealing
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
Pitfalls and best practices in algorithm configuration
Probabilistic graphical models.
Revisiting simulated annealing: a component-based analysis
Simulated annealing - to cool or not
Simulated annealing and tabu search in the long run: A comparison on QAP tasks
Simulated annealing versus Metropolis for a TSP instance
Statistical analysis of local search landscapes
Stochastic local search. Foundations and applications.
Surrogate-based methods
TSPLIB—A Traveling Salesman Problem Library
Tabu Search—Part I
Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
Testing heuristics: We have it all wrong
The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
The book of why. The new science of cause and effect
Theory of evolutionary algorithms: A bird's eye view
Upper and lower bounds for randomized search heuristics in black-box optimization
What makes a VRP solution good? The generation of problem-specific knowledge for heuristics

This page was built for publication: A causal framework for stochastic local search optimization algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974825)