{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:45:30Z","timestamp":1742989530798,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030218027"},{"type":"electronic","value":"9783030218034"}],"license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-21803-4_42","type":"book-chapter","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T22:03:24Z","timestamp":1560549804000},"page":"417-427","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Modelling Dynamic Programming-Based Global Constraints in Constraint Programming"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Visentin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven D.","family":"Prestwich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armagan","family":"Tarim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.X.: Global constraint catalog, (revision a) (2012)","key":"42_CR1"},{"doi-asserted-by":"crossref","unstructured":"Bellman, R.: The theory of dynamic programming. Technical report, RAND Corp Santa Monica CA (1954)","key":"42_CR2","DOI":"10.2307\/1909830"},{"issue":"1","key":"42_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1287\/ijoc.2015.0648","volume":"28","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.J., Hooker, J.N.: Discrete optimization with decision diagrams. INFORMS J. Comput. 28(1), 47\u201366 (2016)","journal-title":"INFORMS J. Comput."},{"unstructured":"Bradley, S.P., Hax, A.C., Magnanti, T.L.: Applied Mathematical Programming. Addison Wesley (1977)","key":"42_CR4"},{"doi-asserted-by":"crossref","unstructured":"Chu, G., Stuckey, P.J.: Minimizing the maximum number of open stacks by customer search. In: International Conference on Principles and Practice of Constraint Programming, pp. 242\u2013257. Springer (2009)","key":"42_CR5","DOI":"10.1007\/978-3-642-04244-7_21"},{"issue":"1","key":"42_CR6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8(1), 101\u2013111 (1960)","journal-title":"Oper. Res."},{"issue":"6","key":"42_CR7","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/opre.35.6.832","volume":"35","author":"GD Eppen","year":"1987","unstructured":"Eppen, G.D., Martin, R.K.: Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper. Res. 35(6), 832\u2013848 (1987)","journal-title":"Oper. Res."},{"unstructured":"Focacci, F., Milano, M.: Connections and integrations of dynamic programming and constraint programming. In: CPAIOR 2001 (2001)","key":"42_CR8"},{"issue":"2","key":"42_CR9","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/s10601-017-9275-0","volume":"23","author":"EC Freuder","year":"2018","unstructured":"Freuder, E.C.: Progress towards the holy grail. Constraints 23(2), 158\u2013171 (2018)","journal-title":"Constraints"},{"doi-asserted-by":"crossref","unstructured":"Malitsky, Y., Sellmann, M., van Hoeve, W.J.: Length-lex bounds consistency for knapsack constraints. In: International Conference on Principles and Practice of Constraint Programming, pp. 266\u2013281. Springer (2008)","key":"42_CR10","DOI":"10.1007\/978-3-540-85958-1_18"},{"unstructured":"Martello, S.: Knapsack Problems: Algorithms and Computer Implementations. Wiley-Interscience Series in Discrete Mathematics and Optimization (1990)","key":"42_CR11"},{"issue":"2","key":"42_CR12","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0377-2217(99)00260-X","volume":"123","author":"S Martello","year":"2000","unstructured":"Martello, S., Pisinger, D., Toth, P.: New trends in exact algorithms for the 0\u20131 knapsack problem. Eur. J. Oper. Res. 123(2), 325\u2013332 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"42_CR13","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1287\/opre.35.6.820","volume":"35","author":"RK Martin","year":"1987","unstructured":"Martin, R.K.: Generating alternative mixed-integer programming models using variable redefinition. Oper. Res. 35(6), 820\u2013831 (1987)","journal-title":"Oper. Res."},{"issue":"5","key":"42_CR14","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1287\/opre.45.5.758","volume":"45","author":"D Pisinger","year":"1997","unstructured":"Pisinger, D.: A minimal algorithm for the 0\u20131 knapsack problem. Oper. Res. 45(5), 758\u2013767 (1997)","journal-title":"Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Plateau, G., Nagih, A.: 0\u20131 knapsack problems. In: Paradigms of Combinatorial Optimization: Problems and New Approaches, vol. 2, pp. 215\u2013242 (2013)","key":"42_CR15","DOI":"10.1002\/9781118600207.ch8"},{"unstructured":"Prestwich, S.D., Rossi, R., Tarim, S.A., Visentin, A.: Towards a closer integration of dynamic programming and constraint programming. In: 4th Global Conference on Artificial Intelligence (2018)","key":"42_CR16"},{"doi-asserted-by":"crossref","unstructured":"Quimper, C.G., Walsh, T.: Global grammar constraints. In: International Conference on Principles and Practice of Constraint Programming, pp. 751\u2013755. Springer (2006)","key":"42_CR17","DOI":"10.1007\/11889205_64"},{"issue":"2","key":"42_CR18","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1609\/aimag.v35i2.2539","volume":"35","author":"PJ Stuckey","year":"2014","unstructured":"Stuckey, P.J., Feydy, T., Schutt, A., Tack, G., Fischer, J.: The minizinc challenge 2008\u20132013. AI Mag. 35(2), 55\u201360 (2014)","journal-title":"AI Mag."},{"doi-asserted-by":"crossref","unstructured":"Zhou, N.F., Kjellerstrand, H., Fruhman, J.: Constraint Solving and Planning with Picat. Springer (2015)","key":"42_CR19","DOI":"10.1007\/978-3-319-25883-6"}],"container-title":["Advances in Intelligent Systems and Computing","Optimization of Complex Systems: Theory, Models, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21803-4_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T05:50:29Z","timestamp":1572587429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21803-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"ISBN":["9783030218027","9783030218034"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21803-4_42","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"15 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCGO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Congress on Global Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wcgo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}