A polynomial time primal network simplex algorithm for minimum cost flows

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

Full metadata record

DC Field	Value	Language
dc.contributor	Orlin, James B., 1953-	-
dc.date	2003-04-29T05:12:25Z	-
dc.date	2003-04-29T05:12:25Z	-
dc.date	1995	-
dc.date.accessioned	2013-06-04T16:14:58Z	-
dc.date.available	2013-06-04T16:14:58Z	-
dc.date.issued	2013-06-05	-
dc.identifier	#3834-95	-
dc.identifier	http://hdl.handle.net/1721.1/2584	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	by James B. Orlin.	-
dc.description	Cover title.	-
dc.description	Includes bibliographical references (p. 25-27).	-
dc.description	Supported by ONR. N00014-94-1-0099 Supported in part by a grant from the UPS foundation.	-
dc.format	27 p.	-
dc.format	2012576 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Sloan School of Management, Massachusetts Institute of Technology]	-
dc.relation	Working paper (Sloan School of Management) ; 3834-95.	-
dc.subject	HD28 .M414 no.3834-95	-
dc.title	A polynomial time primal network simplex algorithm for minimum cost flows	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI