Travelling salesman problem in tissue P systems with costs
From MaRDI portal
Publication:1983010
DOI10.1007/S41965-021-00077-ZzbMATH Open1469.68018OpenAlexW3160331592MaRDI QIDQ1983010FDOQ1983010
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
Combinatorial optimization (90C27) Grammars and rewriting systems (68Q42) 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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maude: specification and programming in rewriting logic
- Membrane computing. An introduction.
- Solution of a Large-Scale Traveling-Salesman Problem
- Tissue P systems.
- Simple, Enhanced and Mutual Mobile Membranes
- The Euclidean traveling salesman problem is NP-complete
- Conditional rewriting logic as a unified model of concurrency
- In Pursuit of the Traveling Salesman
- Specification and proof in membership equational logic
- Turing Completeness Using Three Mobile Membranes
- Reducibility Among Combinatorial Problems
- The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems
- Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors
- A hybrid distribution algorithm based on membrane computing for solving the multiobjective multiple traveling salesman problem
Cited In (2)
Uses Software
This page was built for publication: Travelling salesman problem in tissue P systems with costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1983010)
