A novel solution for GCP based on an OLMS membrane algorithm with dynamic operators
DOI10.1007/S41965-019-00026-XzbMATH Open1469.68021OpenAlexW2988544579WikidataQ126809104 ScholiaQ126809104MaRDI QIDQ1983019FDOQ1983019
Authors: 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
Recommendations
Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Coloring of graphs and hypergraphs (05C15) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reducibility among Combinatorial Problems
- Computing with membranes
- Membrane computing. An introduction.
- Title not available (Why is that?)
- A Membrane Algorithm for the Min Storage Problem
- A quantum-inspired evolutionary algorithm based on P systems for knapsack problem
- Title not available (Why is that?)
- Membrane Computing
- P systems based multi-objective optimization algorithm
- Real-life applications with membrane computing
- An Improved Membrane Algorithm for Solving Time-Frequency Atom Decomposition
Cited In (4)
Uses Software
This page was built for publication: A novel solution for GCP based on an OLMS membrane algorithm with dynamic operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1983019)