Experimental comparison of two evolutionary algorithms for the independent set problem

DOI10.1007/3-540-36605-9_15MaRDI QIDQ4418375zbMATH OpenFDO

Authors Marina S. Zavolovskaya, Pavel Borisovsky

Publication date 10 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2611/26110154.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• An elitist genetic algorithm for the maximum independent set problem.
• A novel evolutionary formulation of the maximum independent set problem
• Applying evolutionary algorithms to combinatorial optimization problems
• Genetic, iterated and multistart local search for the maximum clique problem
• Comparison of certain evolutionary algorithms

Cited in

(4)

• Comparing evolutionary algorithms to the (\(1+1\))-EA
• Reinforcement learning for combinatorial optimization: a survey
• An elitist genetic algorithm for the maximum independent set problem.
• A comparative study of some evolutionary algorithms

This page was built for publication: Experimental comparison of two evolutionary algorithms for the independent set problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418375)