Reichel, JoachimSkutella, Martin2009-05-122009-05-122007-02http://hdl.handle.net/2003/2613210.17877/DE290R-8709We analyze teh performance fo 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 problems.enReihe CI; 225-07combinatorial algorithmscomputations on discrete structuresevolutionary algorithmsmatroid intersectionmatroidsminimum weight basisnonnumerical algorithms and problemsrandomized search heuristics004report