Show simple item record

dc.contributor.authorFreund, Robert Michaelen_US
dc.contributor.authorOrlin, James B.en_US
dc.date.accessioned2009-10-04T00:11:52Z
dc.date.available2009-10-04T00:11:52Z
dc.date.issued1984en_US
dc.identifieroncomplexityoffo00freuen_US
dc.identifier.urihttp://hdl.handle.net/1721.1/48641
dc.publisherCambridge, Mass. : Massachusetts Institute of Technology, Alfred P. Sloan School of Managementen_US
dc.relation.ispartofseriesWorking paper (Sloan School of Management) ; 1527-84.en_US
dc.titleOn the complexity of four polyhedral set containment problemsen_US
dc.typeWorking Paperen_US
dc.identifier.oclc12675177en_US
dc.identifier.aleph000225877en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record