Optimizing binary trees grown with a sorting algorithm,
| Main Authors: | , |
|---|---|
| Format: | Working Paper |
| Published: |
[Cambridge, Mass., M.I.T.]
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/48702 |
| _version_ | 1811082736158375936 |
|---|---|
| author | Martin, William A. Ness, David N. |
| author_facet | Martin, William A. Ness, David N. |
| author_sort | Martin, William A. |
| collection | MIT |
| first_indexed | 2024-09-23T12:08:07Z |
| format | Working Paper |
| id | mit-1721.1/48702 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T12:08:07Z |
| publishDate | 2009 |
| publisher | [Cambridge, Mass., M.I.T.] |
| record_format | dspace |
| spelling | mit-1721.1/487022019-04-12T10:46:49Z Optimizing binary trees grown with a sorting algorithm, Martin, William A. Ness, David N. Branch and bound algorithms. Sorting (Electronic computers) 2009-10-04T00:22:01Z 2009-10-04T00:22:01Z Working Paper optimizingbinary00mart http://hdl.handle.net/1721.1/48702 14408007 000259261 Working paper (Sloan School of Management) ; 421-69. application/pdf [Cambridge, Mass., M.I.T.] |
| spellingShingle | Branch and bound algorithms. Sorting (Electronic computers) Martin, William A. Ness, David N. Optimizing binary trees grown with a sorting algorithm, |
| title | Optimizing binary trees grown with a sorting algorithm, |
| title_full | Optimizing binary trees grown with a sorting algorithm, |
| title_fullStr | Optimizing binary trees grown with a sorting algorithm, |
| title_full_unstemmed | Optimizing binary trees grown with a sorting algorithm, |
| title_short | Optimizing binary trees grown with a sorting algorithm, |
| title_sort | optimizing binary trees grown with a sorting algorithm |
| topic | Branch and bound algorithms. Sorting (Electronic computers) |
| url | http://hdl.handle.net/1721.1/48702 |
| work_keys_str_mv | AT martinwilliama optimizingbinarytreesgrownwithasortingalgorithm AT nessdavidn optimizingbinarytreesgrownwithasortingalgorithm |