Show simple item record

dc.contributor.authorSprague, Christopher R.en_US
dc.date.accessioned2009-10-05T21:12:30Z
dc.date.available2009-10-05T21:12:30Z
dc.date.issued1970en_US
dc.identifiersolutionofthreer00spraen_US
dc.identifier.urihttp://hdl.handle.net/1721.1/49192
dc.publisher[Cambridge, Mass., M.I.T.]en_US
dc.relation.ispartofseriesWorking paper (Sloan School of Management) ; 451-70.en_US
dc.subjectCombinatorial enumeration problems.en_US
dc.titleSolution of three related combinatorial problems by network-flow and "branch and bound" methods,en_US
dc.typeWorking Paperen_US
dc.identifier.oclc14508834en_US
dc.identifier.aleph000259997en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record