Introduction to algorithms
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics
Implementation of Relational Algebra Using Binary Decision Diagrams
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
A generic program for minimal subsets with applications
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Evaluating sets of search points using relational algebra
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
A relation-algebraic view on evolutionary algorithms for some graph problems
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
| Hi-index | 0.00 |
Randomized search heuristics, among them evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to hard problems in combinatorial optimization to get near-optimal solutions. We present a new approach implementing simple parallel evolutionary algorithms by relational methods. Populations are represented as relations which are implicitly encoded by (reduced, ordered) binary decision diagrams. Thereby, the creation and evaluation is done in parallel, which increases efficiency considerably.