Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Sloan School of Management
  3. Sloan Working Papers
  4. Branch and bound methods for combinatorial problems.

Branch and bound methods for combinatorial problems.

Thumbnail Image
Download
Name

branchboundmetho00litt.pdf

Size

1.49 MB

Format

Adobe PDF

Checksum (MD5)

71f007b5f042f5b5c2ef923ad25e8c93

Author(s)
Little, John D. C.
Date Issued
1966
Publisher
[Cambridge, Mass., M.I.T.]
Series/Report no.
Working paper (Sloan School of Management) ; 178-66.
Subjects
Combinatorial analysis.
Branch and bound algorithms.
Persistent DSpace Link
http://hdl.handle.net/1721.1/46907
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.