Travelling salesman problem in tissue P systems with costs

DOI10.1007/s41965-021-00077-zzbMath1469.68018OpenAlexW3160331592MaRDI QIDQ1983010

Gabriel Ciobanu, Bogdan Aman

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-021-00077-z

zbMATH Keywords

travelling salesman problemmembrane computingPriced-Timed Mauderewriting engine

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Grammars and rewriting systems (68Q42) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (1)

Spiking neural P systems with polarizations and astrocytes

Uses Software

• Maude

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditional rewriting logic as a unified model of concurrency
• The Euclidean traveling salesman problem is NP-complete
• Tissue P systems.
• Maude: specification and programming in rewriting logic
• Membrane computing. An introduction.
• Specification and proof in membership equational logic
• A Hybrid Distribution Algorithm Based on Membrane Computing for Solving the Multiobjective Multiple Traveling Salesman Problem
• Turing Completeness Using Three Mobile Membranes
• Reducibility Among Combinatorial Problems
• Simple, Enhanced and Mutual Mobile Membranes
• Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors
• Solution of a Large-Scale Traveling-Salesman Problem
• The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems
• In Pursuit of the Traveling Salesman

This page was built for publication: Travelling salesman problem in tissue P systems with costs