A faster strongly polynomial minimum cost flow algorithm

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

Full metadata record

DC Field	Value	Language
dc.contributor	Orlin, James B., 1953-	-
dc.contributor	Massachusetts Institute of Technology. Operations Research Center	-
dc.date	2004-05-28T19:22:10Z	-
dc.date	2004-05-28T19:22:10Z	-
dc.date	1988	-
dc.date.accessioned	2013-10-09T02:37:31Z	-
dc.date.available	2013-10-09T02:37:31Z	-
dc.date.issued	2013-10-09	-
dc.identifier	OR 175-88	-
dc.identifier	http://hdl.handle.net/1721.1/5073	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	by James B. Orlin.	-
dc.description	Also issued as: Working Paper (Sloan School of Management) ; WP 2042-88	-
dc.description	Includes bibliographical references (leaf 11).	-
dc.description	Supported by a National Science Foundation Presidential Young Investigator Grant. 8451517-ECS Supported by the Air Force Office of Scientific Research, Analog Devices, Apple Computer, and Prime Computer.	-
dc.format	11 leaves	-
dc.format	1368245 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Massachusetts Institute of Technology, Operations Research Center	-
dc.relation	Working paper (Massachusetts Institute of Technology. Operations Research Center) ; OR 175-88. Working paper (Sloan School of Management) ; 2042-88.	-
dc.subject	Q175.M41 O616 no.175-88	-
dc.title	A faster strongly polynomial minimum cost flow algorithm	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI