Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/66758
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | On improving approximate solutions by evolutionary algorithms |
Author: | Friedrich, T. He, J. Hebbinghaus, N. Neumann, F. Witt, C. |
Citation: | IEEE Congress on Evolutionary Computation 2007, pp. 2614-2621 |
Publisher: | IEEE Press |
Publisher Place: | Online |
Issue Date: | 2007 |
Series/Report no.: | IEEE Congress on Evolutionary Computation |
ISBN: | 1424413400 9781424413393 |
Conference Name: | IEEE Congress on Evolutionary Computation (2007 : Singapore) |
Statement of Responsibility: | Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt |
Abstract: | Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different optimization methods is rare. The aim of this paper is to make a first step into the rigorous analysis of such combinations for combinatorial optimization problems. The subject of our analyses is the vertex cover problem for which several approximation algorithms have been proposed. We point out specific instances where solutions can (or cannot) be improved by the search process of a simple evolutionary algorithm in expected polynomial time. |
Rights: | © 2007 IEEE |
DOI: | 10.1109/CEC.2007.4424800 |
Published version: | http://dx.doi.org/10.1109/cec.2007.4424800 |
Appears in Collections: | Aurora harvest 5 Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.