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/2464

Full metadata record

DC Field	Value	Language
dc.contributor	Bertsimas, Dimitris.	-
dc.contributor	Luo, Xiaodong.	-
dc.date	2003-04-29T05:08:33Z	-
dc.date	2003-04-29T05:08:33Z	-
dc.date	1993	-
dc.date.accessioned	2013-06-04T16:14:37Z	-
dc.date.available	2013-06-04T16:14:37Z	-
dc.date.issued	2013-06-05	-
dc.identifier	WP # 3558-93 MSA	-
dc.identifier	http://hdl.handle.net/1721.1/2464	-
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	905583 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Alfred P. Sloan School of Management, Massachusetts Institute of Technology	-
dc.relation	Working paper (Sloan School of Management) ; 3558-93.	-
dc.subject	HD28 .M414 no.3558-, 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