Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2464| Title: | On the worst case complexity of potential reduction algorithms for linear programming |
| Authors: | Bertsimas, Dimitris. Luo, Xiaodong. |
| Keywords: | HD28 .M414 no.3558-, 93 |
| Issue Date: | 5-Jun-2013 |
| Publisher: | Alfred P. Sloan School of Management, Massachusetts Institute of Technology |
| Description: | Dimitris Bertsimas and Xiaodong Luo. Includes bibliographical references (p. 16-17). Supported by a Presidential Young Investigator Award. DDM-9158118 Supported by Draper Laboratory. |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | WP # 3558-93 MSA http://hdl.handle.net/1721.1/2464 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.