Branch-and-bound strategies for dynamic programming
"May 1975."
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Working Paper |
| Published: |
Cambridge, Mass. : Alfred P. Sloan School of Management, Massachusetts Institute of Technology
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/46916 |
| _version_ | 1826214512949198848 |
|---|---|
| author | Morin, Thomas L. Marsten, Roy E. |
| author2 | Sloan School of Management. |
| author_facet | Sloan School of Management. Morin, Thomas L. Marsten, Roy E. |
| author_sort | Morin, Thomas L. |
| collection | MIT |
| description | "May 1975." |
| first_indexed | 2024-09-23T16:06:57Z |
| format | Working Paper |
| id | mit-1721.1/46916 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T16:06:57Z |
| publishDate | 2009 |
| publisher | Cambridge, Mass. : Alfred P. Sloan School of Management, Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/469162019-04-10T12:36:55Z Branch-and-bound strategies for dynamic programming Morin, Thomas L. Marsten, Roy E. Sloan School of Management. Programming (Mathematics) Branch and bound algorithms. "May 1975." 2009-09-29T17:52:17Z 2009-09-29T17:52:17Z 1975 Working Paper branchandboundstx00mori http://hdl.handle.net/1721.1/46916 19990688 000388774 Working paper (Sloan School of Management) ; 750A-74. application/pdf Cambridge, Mass. : Alfred P. Sloan School of Management, Massachusetts Institute of Technology |
| spellingShingle | Programming (Mathematics) Branch and bound algorithms. Morin, Thomas L. Marsten, Roy E. Branch-and-bound strategies for dynamic programming |
| title | Branch-and-bound strategies for dynamic programming |
| title_full | Branch-and-bound strategies for dynamic programming |
| title_fullStr | Branch-and-bound strategies for dynamic programming |
| title_full_unstemmed | Branch-and-bound strategies for dynamic programming |
| title_short | Branch-and-bound strategies for dynamic programming |
| title_sort | branch and bound strategies for dynamic programming |
| topic | Programming (Mathematics) Branch and bound algorithms. |
| url | http://hdl.handle.net/1721.1/46916 |
| work_keys_str_mv | AT morinthomasl branchandboundstrategiesfordynamicprogramming AT marstenroye branchandboundstrategiesfordynamicprogramming |