On the size of weights in randomized search heuristics

DOI10.1145/1527125.1527130zbMath1369.68329OpenAlexW2101034509MaRDI QIDQ5276059

Martin Skutella, Joachim Reichel

Publication date: 14 July 2017

Published in: Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2003/26160

zbMATH Keywords

randomized search heuristics

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (3)

Computing minimum cuts by randomized search heuristics ⋮ Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem ⋮ Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint

This page was built for publication: On the size of weights in randomized search heuristics