Efficiently solving the bin packing problem through bio-inspired mobility
From MaRDI portal
Recommendations
- Solving the bin-packing problem by means of tissue P system with 2-division
- Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems
- A polynomial-time DNA computing solution for the bin-packing problem
- Design patterns for efficient solutions to NP-complete problems in membrane computing
- Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes
Cites work
- scientific article; zbMATH DE number 1583885 (Why is no real title available?)
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Membrane Computing
- Membrane computing. An introduction.
- Mobility in process calculi and natural computing.
- Simple, Enhanced and Mutual Mobile Membranes
- Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems
- The computational power of cell division in P systems: Beating down parallel computers?
- Turing Completeness Using Three Mobile Membranes
Cited in
(8)- Synchronization of rules in membrane computing
- The computational complexity of tissue P systems with evolutional symport/antiport rules
- On the efficiency of synchronized P systems
- Solving SAT with P systems with anti-membranes
- Solving a PSPACE-complete problem by symport/antiport P systems with promoters and membrane division
- Solving the bin-packing problem by means of tissue P system with 2-division
- A Petri net view of covalent bonds
- The power of synchronizing rules in membrane computing
This page was built for publication: Efficiently solving the bin packing problem through bio-inspired mobility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q530219)
