Branch-and-bound strategies for dynamic programming

Branch-and-bound strategies for dynamic programming

Show other versions (1)

"May 1975."

Bibliographic Details
Main Authors: Morin, Thomas L., Marsten, Roy E.
Other Authors: Sloan School of Management.
Format: Working Paper
Published: Cambridge, Mass. : Alfred P. Sloan School of Management, Massachusetts Institute of Technology 2009
Subjects:
Programming (Mathematics)
Branch and bound algorithms.
Online Access:http://hdl.handle.net/1721.1/46916

Internet

http://hdl.handle.net/1721.1/46916

Similar Items