New polynomial-time cycle-canceling algorithms 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/2630

Full metadata record

DC Field	Value	Language
dc.contributor	Sokkalingam, P. T.	-
dc.contributor	Ahuja, Ravindra K., 1956-	-
dc.contributor	Orlin, James B., 1953-	-
dc.date	2003-04-29T05:13:44Z	-
dc.date	2003-04-29T05:13:44Z	-
dc.date	1996	-
dc.date.accessioned	2013-06-04T16:15:02Z	-
dc.date.available	2013-06-04T16:15:02Z	-
dc.date.issued	2013-06-05	-
dc.identifier	#3914-96	-
dc.identifier	http://hdl.handle.net/1721.1/2630	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	by P.T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin.	-
dc.description	Cover title.	-
dc.description	Includes bibliographical references (p. 18).	-
dc.description	Supported by a grant from the United Parcel Service and the Office of Naval Research. N00014-96-1-0051	-
dc.format	18 p.	-
dc.format	1361280 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) ; 3914-96.	-
dc.subject	HD28 .M414 no.3914-96	-
dc.title	New polynomial-time cycle-canceling algorithms for minimum cost flows	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI