Solving Multidimensional 0-1 Knapsack Problem by P Systems with Input and Active Membranes

dc.creator	Pan, Linqiang
dc.creator	Martín Vide, Carlos
dc.date.accessioned	2016-02-24T08:25:11Z
dc.date.available	2016-02-24T08:25:11Z
dc.date.issued	2004
dc.identifier.isbn	84-688-6101-4	es
dc.identifier.uri	http://hdl.handle.net/11441/36407
dc.description.abstract	P systems are parallel molecular computing models based on pro- cessing multisets of objects in cell-like membrane structures. In this paper we give a membrane algorithm to multidimensional 0-1 knapsack problem in lin- ear time by recognizer P systems with input and with active membranes using 2-division. This algorithm can also be modi¯ed to solve general 0-1 integer programming problem.	es
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.publisher	Fénix Editora	es
dc.relation.ispartof	Proceedings of the Second Brainstorming Week on Membrane Computing, 342-353. Sevilla, E.T.S. de Ingeniería Informática, 2-7 de Febrero, 2004	es
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.title	Solving Multidimensional 0-1 Knapsack Problem by P Systems with Input and Active Membranes	es
dc.type	info:eu-repo/semantics/conferenceObject	es
dc.type.version	info:eu-repo/semantics/publishedVersion	es
dc.rights.accessRights	info:eu-repo/semantics/openAccess
dc.identifier.idus	https://idus.us.es/xmlui/handle/11441/36407

Ficheros	Tamaño	Formato	Ver	Descripción
PROG.pdf	157.2Kb	[PDF]	Ver/Abrir

Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional