A Membrane Algorithm for the Min Storage Problem

DOI10.1007/11963516_28MaRDI QIDQ3591009zbMATH OpenOpenAlexFDO

Authors Alberto Leporati, Dario Pagani

Publication date 3 September 2007

Published in Membrane Computing (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.8645

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• Membrane Computing
• scientific article; zbMATH DE number 1583871
• Mobile membranes: computability and complexity
• Membrane Computing
• Membrane algorithm with Brownian subalgorithm and genetic subalgorithm

Cited in

(9)

• Membrane algorithm with Brownian subalgorithm and genetic subalgorithm
• A membrane algorithm with quantum-inspired subalgorithms and its application to image processing
• A novel solution for GCP based on an OLMS membrane algorithm with dynamic operators
• Membrane computing to enhance time efficiency of minimum dominating set
• Approximation bounds for the minimum k-storage problem
• Evolutionary algorithm based on dynamical structure of membrane systems in uncertain environments
• Membrane Computing
• A branch and bound algorithm for the minimum storage-time sequencing problem
• A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows

This page was built for publication: A Membrane Algorithm for the Min Storage Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591009)