Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
Citable URI:
http://hdl.handle.net/1721.1/44583
| Title: | Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model |
| Author: | Veraz, Jorge; Freund, Robert M. |
| Publisher: | Massachusetts Institute of Technology, Operations Research Center |
| Issue Date: | 2009-02-03 |
| URI: | http://hdl.handle.net/1721.1/44583 |
| Series/Report no.: | ;OR 383-09 |
Files in this item
| Files | Size | Format |
|---|---|---|
| OR 383-09.pdf | 235.3Kb | application/pdf |
This item appears in the following Collection(s)
All Items in DSpace@MIT are protected by original copyright, with all rights reserved, unless otherwise indicated.
|
|
Contact
MIT Libraries
|