Computational complexity of the capacitated lot size problem

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

Full metadata record

DC Field	Value	Language
dc.contributor	Bitran, Gabriel R.	-
dc.contributor	Yanasse, Horacio H.	-
dc.date	2003-04-29T04:54:42Z	-
dc.date	2003-04-29T04:54:42Z	-
dc.date	1981	-
dc.date.accessioned	2013-05-31T21:48:41Z	-
dc.date.available	2013-05-31T21:48:41Z	-
dc.date.issued	2013-06-01	-
dc.identifier	http://hdl.handle.net/1721.1/2006	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/jspui/handle/1721	-
dc.description	Gabriel R. Bitran, Horacio H. Yanasse.	-
dc.description	Bibliography: p. 24.	-
dc.format	24 p.	-
dc.format	1109355 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Alfred P. Sloan School of Management, Massachusetts Institute of Technology	-
dc.relation	Working paper (Sloan School of Management) ; 1271-81.	-
dc.subject	HD28 .M414 no.1271-, 81	-
dc.title	Computational complexity of the capacitated lot size problem	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI