The complexity of optimal queueing network control

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3366

Full metadata record

DC Field	Value	Language
dc.contributor	Papadimitriou, Christos H.	-
dc.contributor	Tsitsiklis, John N.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.date	2003-04-29T15:40:14Z	-
dc.date	2003-04-29T15:40:14Z	-
dc.date	1994	-
dc.date.accessioned	2013-06-04T16:16:48Z	-
dc.date.available	2013-06-04T16:16:48Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/3366	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	Christos H. Papdimitriou, John N. Tsitsiklis.	-
dc.description	Caption title.	-
dc.description	Includes bibliographical references (leaf 5).	-
dc.description	Supported by the ARO. DDAL03-92-G-0115	-
dc.format	5 leaves	-
dc.format	802537 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems]	-
dc.relation	LIDS-P ; 2241	-
dc.subject	TK7855.M41 E3845 no.2241	-
dc.title	The complexity of optimal queueing network control	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI