On the complexity of approximating the maximal inscribed ellipsoid for a polytope
| dc.contributor.author | Khachiyan, L. G. | en_US |
| dc.contributor.author | Todd, M. J. | en_US |
| dc.date.accessioned | 2007-11-09T20:00:17Z | |
| dc.date.available | 2007-11-09T20:00:17Z | |
| dc.date.issued | 1990-02 | en_US |
| dc.description.abstract | This paper published in "Communications in Statistics-Simulation and Computation" 19(3) (1990), 971-1006 | en_US |
| dc.format.extent | 2464656 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | 893 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/8776 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University Operations Research and Industrial Engineering | en_US |
| dc.subject | Operations Research | en_US |
| dc.subject | Industrial Engineering | en_US |
| dc.subject | technical report | en_US |
| dc.title | On the complexity of approximating the maximal inscribed ellipsoid for a polytope | en_US |
| dc.type | technical report | en_US |
Files
Original bundle
1 - 1 of 1