We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Branch-and-bound strategies for dynamic programming

Thumbnail Image
Download
Name

branchandboundstx00mori.pdf

Size

1.51 MB

Format

Adobe PDF

Checksum (MD5)

4091d953b1aec4be3eff322a519ee234

Author(s)
Morin, Thomas L.
•
Marsten, Roy E.
Date Issued
1975
Publisher
Cambridge, Mass. : Alfred P. Sloan School of Management, Massachusetts Institute of Technology
Series/Report no.
Working paper (Sloan School of Management) ; 750A-74.
Description
"May 1975."
Subjects
Programming (Mathematics)
Branch and bound algorithms.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.