Show simple item record

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

dc.contributor.authorVeraz, Jorge
dc.contributor.authorFreund, Robert M.
dc.date.accessioned2009-02-03T20:08:43Z
dc.date.available2009-02-03T20:08:43Z
dc.date.issued2009-02-03T20:08:43Z
dc.identifier.urihttp://hdl.handle.net/1721.1/44583
dc.language.isoen_USen
dc.publisherMassachusetts Institute of Technology, Operations Research Centeren_US
dc.relation.ispartofseries;OR 383-09
dc.titleEquivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Modelen
dc.typeWorking Paperen


Files in this item

Thumbnail
Name:
OR 383-09.pdf
Size:
229.8Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record