The time complexity of maximum matching by simulated annealing
From MaRDI portal
Publication:4711428
DOI10.1145/42282.46160zbMath0825.68416OpenAlexW1985318592MaRDI QIDQ4711428
Publication date: 25 June 1992
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/42282.46160
Related Items (23)
An improved simulated annealing simulation optimization method for discrete parameter stochastic systems ⋮ Metaheuristics: A bibliography ⋮ The Metropolis algorithm for graph bisection ⋮ Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift ⋮ Randomized local search, evolutionary algorithms, and the minimum spanning tree problem ⋮ The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems ⋮ Choosing the right algorithm with hints from complexity theory ⋮ Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem ⋮ Simplified drift analysis for proving lower bounds in evolutionary computation ⋮ Simulated annealing: A tool for operational research ⋮ Unnamed Item ⋮ Modelling the dynamics of stochastic local search on \(k\)-SAT ⋮ A simulated annealing channel routing algorithm ⋮ Integer programs for logic constraint satisfaction ⋮ How to escape local optima in black box optimisation: when non-elitism outperforms elitism ⋮ Drift analysis and average time complexity of evolutionary algorithms ⋮ Some results characterizing the finite time behaviour of the simulated annealing algorithm. ⋮ Recent advances in evolutionary computation ⋮ TOPOLOGICAL ANALYSIS OF SPECIFIC SPATIAL COMPLEX NETWORKS ⋮ Simulated annealing - to cool or not ⋮ The effect of the density of states on the Metropolis algorithm ⋮ Finite-Time Behavior of Slowly Cooled Annealing Chains ⋮ A new genetic algorithm
This page was built for publication: The time complexity of maximum matching by simulated annealing
