Show simple item record

Optimizing binary trees grown with a sorting algorithm,

dc.contributor.authorMartin, William A.en_US
dc.contributor.authorNess, David N.en_US
dc.date.accessioned2009-10-04T00:22:01Z
dc.date.available2009-10-04T00:22:01Z
dc.date.issueden_US
dc.identifieroptimizingbinary00marten_US
dc.identifier.urihttp://hdl.handle.net/1721.1/48702
dc.publisher[Cambridge, Mass., M.I.T.]en_US
dc.relation.ispartofseriesWorking paper (Sloan School of Management) ; 421-69.en_US
dc.subjectBranch and bound algorithms.en_US
dc.subjectSorting (Electronic computers)en_US
dc.titleOptimizing binary trees grown with a sorting algorithm,en_US
dc.typeWorking Paperen_US
dc.identifier.oclc14408007en_US
dc.identifier.aleph000259261en_US


Files in this item

Thumbnail
Name:
optimizingbinary00mart.pdf
Size:
1.086Mb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record