A method for the parametric center problem, with a strictly monotone polynomial-time algorithm for linear programming

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

Full metadata record

DC Field	Value	Language
dc.contributor	Freund, Robert M.	-
dc.contributor	Tan, Kok-Choon	-
dc.contributor	Massachusetts Institute of Technology. Operations Research Center	-
dc.date	2004-05-28T19:29:57Z	-
dc.date	2004-05-28T19:29:57Z	-
dc.date	1989	-
dc.date.accessioned	2013-10-09T02:38:36Z	-
dc.date.available	2013-10-09T02:38:36Z	-
dc.date.issued	2013-10-09	-
dc.identifier	OR 192-89	-
dc.identifier	http://hdl.handle.net/1721.1/5247	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	by Robert M. Freund and Kok-Choon Tan.	-
dc.description	Also issued as: Working paper (Sloan School of Management) ; WP 2100-89.	-
dc.description	Includes bibliographical references (p.[53]-[54]).	-
dc.format	52, [2] p.	-
dc.format	2054304 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 192-89. Working paper (Sloan School of Management) ; 2100-89.	-
dc.subject	Q175.M41 O616 no.192-89	-
dc.title	A method for the parametric center problem, with a strictly monotone polynomial-time algorithm for linear programming	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI