A genetic algorithm for the maximum 2-packing set problem

DOI10.34768/AMCS-2020-0014MaRDI QIDQ2019714zbMATHOpenAlexFDO

Authors Daniel Fajardo-Delgado, J. Octavio Gutierrez-Garcia, Joel Trejo-Sanchez

Publication date 22 April 2021

Published in International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL https://content.sciendo.com/view/journals/amcs/30/1/article-p173.xml

zbMATH Keywords

genetic algorithmsgraph algorithmsmaximum 2-packing set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed algorithms (68W15)

Recommendations

• Algorithm to find a maximum 2-packing set in a cactus
• Genetic algorithmic approach to find the maximum weight independent set of a graph
• A genetic algorithm for the set covering problem
• Improved genetic algorithm for maximum clique problem
• A new heuristic algorithm to solve the maximum independent set problem

Cites work

• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 2114409 (Why is no real title available?)
• A Best Possible Heuristic for the k-Center Problem
• A Markov chain approach to randomly grown graphs
• A hybrid iterated local search heuristic for the maximum weight independent set problem
• A robust algorithm to solve the signal setting problem considering different traffic assignment approaches
• A self-stabilizing algorithm for a maximal 2-packing in a cactus graph under any scheduler
• A self-stabilizing algorithm to maximal 2-packing with improved complexity
• Algorithm to find a maximum 2-packing set in a cactus
• An introduction to systems biology. Design principles of biological circuits
• Closest paths in graph drawings under an elastic metric
• Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
• Efficient transformation of distance-2 self-stabilizing algorithms
• Fast local search for the maximum independent set problem
• Introduction to evolutionary computing
• Reducibility among combinatorial problems
• The packing number of the double vertex graph of the path graph
• When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks

Cited in

(5)

• A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
• On genetic algorithms for the packing of polygons
• A genetic algorithm for determining the thickness of a graph
• Genetic Algorithms and Heuristic Rules for Solving the Nesting Problem in the Package Industry
• scientific article; zbMATH DE number 953062 (Why is no real title available?)

Describes a project that uses

Uses Software

• PBGL
• DEAP
• ils-mwis

This page was built for publication: A genetic algorithm for the maximum 2-packing set problem

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