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 strategies for dynamic programming

Branch-and bound strategies for dynamic programming

Thumbnail Image
Download
Name

branchandboundst00mori.pdf

Size

1.77 MB

Format

Adobe PDF

Checksum (MD5)

a1445409dcb7731dc857affc66fd2734

Author(s)
Morin, Thomas L.
•
Marsten, Roy E.
Date Issued
1974
Publisher
Cambridge, M.I.T
Series/Report no.
Working paper (Sloan School of Management) ; 750-74.
Subjects
Programming (Mathematics)
Branch and bound algorithms.
Persistent DSpace Link
http://hdl.handle.net/1721.1/46931
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.