Show simple item record

Branch-and bound strategies for dynamic programming

dc.contributor.authorMorin, Thomas L.en_US
dc.contributor.authorMarsten, Roy E.en_US
dc.date.accessioned2009-09-29T17:54:45Z
dc.date.available2009-09-29T17:54:45Z
dc.date.issued1974en_US
dc.identifierbranchandboundst00morien_US
dc.identifier.urihttp://hdl.handle.net/1721.1/46931
dc.publisherCambridge, M.I.Ten_US
dc.relation.ispartofseriesWorking paper (Sloan School of Management) ; 750-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.oclc14451168en_US
dc.identifier.aleph000259752en_US


Files in this item

Thumbnail
Name:
branchandboundst00mori.pdf
Size:
1.768Mb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record