The Applications of Object Migration Automaton (OMA)-Memetic Algorithm for Solving NP-Hard Problems

DOI10.1007/978-3-030-76291-9_6zbMath1485.68221OpenAlexW3173540037MaRDI QIDQ5861761

No author found.

Publication date: 2 March 2022

Published in: Intelligent Systems Reference Library (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-76291-9_6

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Sequential and multi-population memetic algorithms for assigning cells to switches in mobile networks.
• Deterministic learning automata solutions to the equipartitioning problem
• An Algorithm for Subgraph Isomorphism

This page was built for publication: The Applications of Object Migration Automaton (OMA)-Memetic Algorithm for Solving NP-Hard Problems