Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Operations Research Center
  3. Operations Research Center Working Papers
  4. Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model

Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model

Thumbnail Image
Download
Name

OR 383-09.pdf

Size

229.83 KB

Format

Adobe PDF

Checksum (MD5)

7966a0a5a231a2c1ce0daf7efcbaa3e1

Author(s)
Veraz, Jorge
•
Freund, Robert M.
Date Issued
February 3, 2009
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
;OR 383-09
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
http://hdl.handle.net/1721.1/44583
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.