An elitist genetic algorithm for the maximum independent set problem.

DOI10.1109/ITI.2001.938044MaRDI QIDQ2768237zbMATH OpenFDO

Authors Andrej Taranenko, Aleksander Vesel

Publication date 30 January 2002

Published in Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001. (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/ITI.2001.938044

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems
• Genetic algorithmic approach to find the maximum weight independent set of a graph
• A new heuristic algorithm to solve the maximum independent set problem
• An unconstrained binary quadratic programming for the maximum independent set problem
• scientific article; zbMATH DE number 1961986

Cited in

(3)

• Genetic algorithmic approach to find the maximum weight independent set of a graph
• A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems
• scientific article; zbMATH DE number 1961986 (Why is no real title available?)

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication: An elitist genetic algorithm for the maximum independent set problem.

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