MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Author(s)
Veraz, Jorge; Freund, Robert M.
Thumbnail
DownloadOR 383-09.pdf (229.8Kb)
Metadata
Show full item record
Date issued
2009-02-03
URI
http://hdl.handle.net/1721.1/44583
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
;OR 383-09

Collections
  • Operations Research Center Working Papers

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.