{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:33Z","timestamp":1750307793875,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,1,7]],"date-time":"2008-01-07T00:00:00Z","timestamp":1199664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,1,7]]},"DOI":"10.1145\/1328408.1328421","type":"proceedings-article","created":{"date-parts":[[2008,1,7]],"date-time":"2008-01-07T14:45:40Z","timestamp":1199717140000},"page":"81-89","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Automating branch-and-bound for dynamic programs"],"prefix":"10.1145","author":[{"given":"Jakob","family":"Puchinger","sequence":"first","affiliation":[{"name":"University of Melbourne, Australia, Melbourne, Australia"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[{"name":"University of Melbourne, Australia, Melbourne, Australia"}]}],"member":"320","published-online":{"date-parts":[[2008,1,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Dynamic Programming","author":"Bellman R.","year":"1957","unstructured":"R. Bellman . Dynamic Programming . Princeton University Press , 1957 . R. Bellman. Dynamic Programming. Princeton University Press, 1957."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.37.9.1195"},{"key":"e_1_3_2_1_3_1","volume-title":"Constraint Modelling Challenge","author":"Challenge Constraint Modelling","year":"2005","unstructured":"Constraint Modelling Challenge . Constraint Modelling Challenge 2005 . http:\/\/www.dcs.st-and.ac.uk\/~ipg\/challenge\/+, 2005. Constraint Modelling Challenge. Constraint Modelling Challenge 2005. http:\/\/www.dcs.st-and.ac.uk\/~ipg\/challenge\/+, 2005."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.5.2.266"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.3115\/1220575.1220611"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1060.0205"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646061.676145"},{"key":"e_1_3_2_1_8_1","first-page":"1239","volume-title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","author":"Hohwald H.","year":"2003","unstructured":"H. Hohwald , I. Thayer , and R. E. Korf . Comparing best-first search and dynamic programming for optimal multiple sequence alignment. In Georg Gottlob and Toby Walsh, editors, IJCAI-03 , Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence , pages 1239 -- 1245 . Morgan Kaufmann , 2003 . H. Hohwald, I. Thayer, and R. E. Korf. Comparing best-first search and dynamic programming for optimal multiple sequence alignment. In Georg Gottlob and Toby Walsh, editors, IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pages 1239--1245. Morgan Kaufmann, 2003."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023068020483"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.45.3.414"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1038\/218019a0"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.24.4.611"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11603023_11"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0149094"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.15.1.83"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2006.01.006"}],"event":{"name":"PEPM08: Partial Evaluation and Program Manipulation","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Francisco California USA","acronym":"PEPM08"},"container-title":["Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1328408.1328421","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1328408.1328421","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:22Z","timestamp":1750254982000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1328408.1328421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,7]]},"references-count":17,"alternative-id":["10.1145\/1328408.1328421","10.1145\/1328408"],"URL":"https:\/\/doi.org\/10.1145\/1328408.1328421","relation":{},"subject":[],"published":{"date-parts":[[2008,1,7]]},"assertion":[{"value":"2008-01-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}