{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:27:06Z","timestamp":1742912826973,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319729251"},{"type":"electronic","value":"9783319729268"}],"license":[{"start":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T00:00:00Z","timestamp":1513814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-72926-8_47","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T17:42:36Z","timestamp":1513791756000},"page":"562-573","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Refining Partial Invalidations for Indexed Algebraic Dynamic Programming"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Bacher","sequence":"first","affiliation":[]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"47_CR1","volume-title":"Dynamic Programming","author":"R Bellman","year":"1957","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)"},{"key":"47_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/3-540-45719-4_24","volume-title":"Algebraic Methodology and Software Technology","author":"R Giegerich","year":"2002","unstructured":"Giegerich, R., Meyer, C.: Algebraic Dynamic Programming. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol. 2422, pp. 349\u2013364. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45719-4_24"},{"issue":"3","key":"47_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.scico.2003.12.005","volume":"51","author":"R Giegerich","year":"2004","unstructured":"Giegerich, R., Meyer, C., Steffen, P.: A discipline of dynamic programming over sequence data. Sci. Comput. Program. 51(3), 215\u2013263 (2004)","journal-title":"Sci. Comput. Program."},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"Sauthoff, G., Janssen, S., Giegerich, R.: Bellman\u2019s GAP: a declarative language for dynamic programming. In: Proceedings of the 13th International ACM SIGPLAN Symposium on Principles and Practices of Declarative Programming, pp. 29\u201340. ACM (2011)","DOI":"10.1145\/2003476.2003484"},{"issue":"5","key":"47_CR5","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1093\/bioinformatics\/btt022","volume":"29","author":"G Sauthoff","year":"2013","unstructured":"Sauthoff, G., M\u00f6hl, M., Janssen, S., Giegerich, R.: Bellman\u2019s GAP\u2013a language and compiler for dynamic programming in sequence analysis. Bioinformatics 29(5), 551\u2013560 (2013)","journal-title":"Bioinformatics"},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2016.05.032","volume":"639","author":"Algebraic dynamic programming for multiple context-free grammars","year":"2016","unstructured":"Algebraic dynamic programming for multiple context-free grammars: Riechert, M., H\u00f6ner zu Siederdissen, C., Stadler, P.F. Theoret. Comput. Sci. 639, 91\u2013109 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"47_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-12418-6_8","volume-title":"Advances in Bioinformatics and Computational Biology","author":"C H\u00f6ner zu Siederdissen","year":"2014","unstructured":"H\u00f6ner zu Siederdissen, C., Prohaska, S.J., Stadler, P.F.: Dynamic Programming for Set Data Types. In: Campos, S. (ed.) BSB 2014. LNCS, vol. 8826, pp. 57\u201364. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12418-6_8"},{"issue":"19","key":"47_CR8","first-page":"1","volume":"16","author":"SJ Prohaska","year":"2015","unstructured":"Prohaska, S.J., Stadler, P.F.: Algebraic dynamic programming over general data structures. BMC Bioinform. 16(19), 1\u201313 (2015)","journal-title":"BMC Bioinform."},{"issue":"2","key":"47_CR9","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1080\/00207540802426599","volume":"47","author":"C Prins","year":"2009","unstructured":"Prins, C., Labadi, N., Reghioui, M.: Tour splitting algorithms for vehicle routing problems. Int. J. Prod. Res. 47(2), 507\u2013535 (2009)","journal-title":"Int. J. Prod. Res."},{"key":"47_CR10","volume-title":"Extending algebraic dynamic programming for modelling and solving combinatorial optimization problems","author":"C Bacher","year":"2017","unstructured":"Bacher, C., Raidl, G.R.: Extending algebraic dynamic programming for modelling and solving combinatorial optimization problems. Technical report, Algorithms and Complexity Group, TU Wien, Vienna, Austria (2017). in Preparation)"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Sauthoff, G.: Bellman\u2019s GAP: A 2nd Generation Language and System for Algebraic Dynamic Programming. Ph.D. thesis, Bielefeld University (2010)","DOI":"10.1145\/2003476.2003484"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72926-8_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:09:33Z","timestamp":1710324573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-72926-8_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,21]]},"ISBN":["9783319729251","9783319729268"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72926-8_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,12,21]]},"assertion":[{"value":"21 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Machine Learning, Optimization, and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Volterra","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.taosciences.it\/mod\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}