Show simple item record

dc.contributor.authorMorin, Thomas L.en_US
dc.contributor.authorMarsten, Roy E.en_US
dc.contributor.otherSloan School of Management.en_US
dc.date.accessioned2009-09-29T17:52:17Z
dc.date.available2009-09-29T17:52:17Z
dc.date.issued1975en_US
dc.identifierbranchandboundstx00morien_US
dc.identifier.urihttp://hdl.handle.net/1721.1/46916
dc.description"May 1975."en_US
dc.publisherCambridge, Mass. : Alfred P. Sloan School of Management, Massachusetts Institute of Technologyen_US
dc.relation.ispartofseriesWorking paper (Sloan School of Management) ; 750A-74.en_US
dc.subjectProgramming (Mathematics)en_US
dc.subjectBranch and bound algorithms.en_US
dc.titleBranch-and-bound strategies for dynamic programmingen_US
dc.typeWorking Paperen_US
dc.identifier.oclc19990688en_US
dc.identifier.aleph000388774en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record