Travelling salesman problem in tissue P systems with costs
From MaRDI portal
Publication:1983010
Recommendations
Cites work
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 1142329 (Why is no real title available?)
- scientific article; zbMATH DE number 7318976 (Why is no real title available?)
- A hybrid distribution algorithm based on membrane computing for solving the multiobjective multiple traveling salesman problem
- Conditional rewriting logic as a unified model of concurrency
- In pursuit of the traveling salesman. Mathematics at the limits of computation
- Maude: specification and programming in rewriting logic
- Membrane computing. An introduction.
- Reducibility among combinatorial problems
- Rewriting logic specification of membrane systems with promoters and inhibitors
- Simple, Enhanced and Mutual Mobile Membranes
- Solution of a Large-Scale Traveling-Salesman Problem
- Specification and proof in membership equational logic
- Spiking neural P systems
- The Euclidean traveling salesman problem is NP-complete
- The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems
- The traveling salesman problem. A computational study.
- Tissue P systems.
- Turing Completeness Using Three Mobile Membranes
Cited in
(2)
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)