Show simple item record

Branch and bound methods for combinatorial problems.

dc.contributor.authorLittle, John D. C.en_US
dc.date.accessioned2009-09-29T17:50:29Z
dc.date.available2009-09-29T17:50:29Z
dc.date.issued1966en_US
dc.identifierbranchboundmetho00litten_US
dc.identifier.urihttp://hdl.handle.net/1721.1/46907
dc.publisher[Cambridge, Mass., M.I.T.]en_US
dc.relation.ispartofseriesWorking paper (Sloan School of Management) ; 178-66.en_US
dc.subjectCombinatorial analysis.en_US
dc.subjectBranch and bound algorithms.en_US
dc.titleBranch and bound methods for combinatorial problems.en_US
dc.typeWorking Paperen_US
dc.identifier.oclc14339321en_US
dc.identifier.aleph000257734en_US


Files in this item

Thumbnail
Name:
branchboundmetho00litt.pdf
Size:
1.492Mb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record