A novel solution for GCP based on an OLMS membrane algorithm with dynamic operators

DOI10.1007/S41965-019-00026-XzbMath1469.68021OpenAlexW2988544579WikidataQ126809104 ScholiaQ126809104MaRDI QIDQ1983019

José Antonio Andreu-Guzmán, Luis Valencia-Cabrera

Publication date: 14 September 2021

Published in: Journal of Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41965-019-00026-x

zbMATH Keywords

graph coloringNP-hard problemsdynamic genetic operatorsmembrane algorithms

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Coloring of graphs and hypergraphs (05C15) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (3)

Spiking neural P systems with a flat maximally parallel use of rules ⋮ Asynchronous spiking neural P systems with local synchronization of rules ⋮ Evolutionary P systems: the notion and an example

Uses Software

• DIMACS

Cites Work

• P systems based multi-objective optimization algorithm
• Computing with membranes
• Real-life applications with membrane computing
• Membrane computing. An introduction.
• A Membrane Algorithm for the Min Storage Problem
• Reducibility among Combinatorial Problems
• An Improved Membrane Algorithm for Solving Time-Frequency Atom Decomposition
• Membrane Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A novel solution for GCP based on an OLMS membrane algorithm with dynamic operators