期刊
ALGORITHMICA
卷 57, 期 1, 页码 187-206出版社
SPRINGER
DOI: 10.1007/s00453-008-9253-4
关键词
Evolutionary algorithms; Matroids; Minimum weight basis; Matroid intersection; Randomized search heuristics
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatorial optimization problems (including many well-known examples such as minimum spanning tree and maximum bipartite matching). We obtain very promising bounds on the expected running time and quality of the computed solution. Our results establish a better theoretical understanding of why randomized search heuristics yield empirically good results for many real-world optimization problems.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据