MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Sloan School of Management
  • Sloan Working Papers
  • View Item
  • DSpace@MIT Home
  • Sloan School of Management
  • Sloan Working Papers
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Branch and bound methods for combinatorial problems.

Author(s)
Little, John D. C.
Thumbnail
Downloadbranchboundmetho00litt.pdf (1.492Mb)
Metadata
Show full item record
Date issued
1966
URI
http://hdl.handle.net/1721.1/46907
Publisher
[Cambridge, Mass., M.I.T.]
Other identifiers
branchboundmetho00litt
Series/Report no.
Working paper (Sloan School of Management) ; 178-66.
Keywords
Combinatorial analysis., Branch and bound algorithms.

Collections
  • Sloan Working Papers

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.