On the worst case complexity of potential reduction algorithms for linear programming

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

Full metadata record

DC Field	Value	Language
dc.contributor	Bertsimas, Dimitris J.	-
dc.contributor	Luo, Xiaodong	-
dc.date	2004-05-28T19:24:31Z	-
dc.date	2004-05-28T19:24:31Z	-
dc.date	1993	-
dc.date.accessioned	2013-10-09T02:37:53Z	-
dc.date.available	2013-10-09T02:37:53Z	-
dc.date.issued	2013-10-09	-
dc.identifier	http://hdl.handle.net/1721.1/5130	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	Dimitris Bertsimas and Xiaodong Luo.	-
dc.description	Includes bibliographical references (p. 16-17).	-
dc.description	Supported by a Presidential Young Investigator Award. DDM-9158118 Supported by Draper Laboratory.	-
dc.format	17 p.	-
dc.format	1492930 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Massachusetts Institute of Technology, Operations Research Center	-
dc.relation	Operations Research Center Working Paper;OR 279-93	-
dc.title	On the worst case complexity of potential reduction algorithms for linear programming	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI