New algorithms for assignment and transportation problems

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

Full metadata record

DC Field	Value	Language
dc.contributor	Bertsekas, Dimitri P.	-
dc.date	2003-04-29T15:43:45Z	-
dc.date	2003-04-29T15:43:45Z	-
dc.date	1979	-
dc.date.accessioned	2013-06-04T16:17:54Z	-
dc.date.available	2013-06-04T16:17:54Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/3476	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	by Dimitri P. Bertsekas.	-
dc.description	Includes bibliographies.	-
dc.description	Research supported by National Science Foundation Grant ENG-79-06332 (87649)	-
dc.format	34, [7] leaves	-
dc.format	2581845 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems	-
dc.relation	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. LIDS-R ; 945.	-
dc.subject	TK7855.M41 E386 no.945	-
dc.subject	Algorithms	-
dc.subject	Computational complexity	-
dc.subject	Network analysis (Planning)	-
dc.title	New algorithms for assignment and transportation problems	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI