Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14408
For citation please use:
Main Title: Evolutionary Algorithms and Matroid Optimization Problems
Author(s): Reichel, Joachim
Skutella, Martin
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15635
http://dx.doi.org/10.14279/depositonce-14408
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: 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.
Subject(s): evolutionary algorithms
matroids
minimum weight basis
matroid intersection
randomized search heuristics
Issue Date: 2008
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2008, 24
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-024-2008.pdf
Format: Adobe PDF | Size: 266.7 kB
DownloadShow Preview
Thumbnail
Report-024-2008.ps.gz
Format: Unknown | Size: 201.55 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.