Efficiently solving the bin packing problem through bio-inspired mobility

DOI10.1007/s00236-016-0264-3zbMath1371.68079OpenAlexW2299756117WikidataQ57936269 ScholiaQ57936269MaRDI QIDQ530219

Gabriel Ciobanu, Bogdan Aman

Publication date: 9 June 2017

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-016-0264-3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Solving a PSPACE-complete problem by symport/antiport P systems with promoters and membrane division, Solving SAT with P systems with anti-membranes, The power of synchronizing rules in membrane computing, On the efficiency of synchronized P systems, The computational complexity of tissue P systems with evolutional symport/antiport rules, Synchronization of rules in membrane computing, A Petri net view of covalent bonds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mobility in process calculi and natural computing.
• 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?
• Membrane computing. An introduction.
• Turing Completeness Using Three Mobile Membranes
• Simple, Enhanced and Mutual Mobile Membranes
• Membrane Computing