{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:32:42Z","timestamp":1725888762504},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319597751"},{"type":"electronic","value":"9783319597768"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59776-8_23","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T09:26:33Z","timestamp":1496136393000},"page":"277-292","source":"Crossref","is-referenced-by-count":0,"title":["Scenario-Based Learning for Stochastic Combinatorial Optimisation"],"prefix":"10.1007","author":[{"given":"David","family":"Hemmi","sequence":"first","affiliation":[]},{"given":"Guido","family":"Tack","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Wallace","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"issue":"6","key":"23_CR1","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/j.orl.2013.07.009","volume":"41","author":"S Ahmed","year":"2013","unstructured":"Ahmed, S.: A scenario decomposition algorithm for 0\u20131 stochastic programs. Oper. Res. Lett. 41(6), 565\u2013569 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"23_CR2","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.ejor.2005.01.035","volume":"173","author":"M Albareda-Sambola","year":"2006","unstructured":"Albareda-Sambola, M., Van Der Vlerk, M.H., Fern\u00e1ndez, E.: Exact solutions to a class of stochastic generalized assignment problems. Eur. J. Oper. Res. 173(2), 465\u2013487 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/11889205_6","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"T Balafoutis","year":"2006","unstructured":"Balafoutis, T., Stergiou, K.: Algorithms for stochastic CSPs. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 44\u201358. Springer, Heidelberg (2006). doi:\n10.1007\/11889205_6"},{"key":"23_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"2011","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer Science & Business Media, New York (2011)"},{"issue":"3","key":"23_CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(3), 157\u2013183 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"23_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0167-6377(98)00050-9","volume":"24","author":"CC Car\u00f8E","year":"1999","unstructured":"Car\u00f8E, C.C., Schultz, R.: Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24(1), 37\u201345 (1999)","journal-title":"Oper. Res. Lett."},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-33558-7_19","volume-title":"Principles and Practice of Constraint Programming","author":"G Chu","year":"2012","unstructured":"Chu, G., Stuckey, P.J.: Inter-instance nogood learning in constraint programming. In: Milano, M. (ed.) CP 2012. LNCS, pp. 238\u2013247. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-33558-7_19"},{"key":"23_CR8","unstructured":"Chu, G.G.: Improving combinatorial optimization. Ph.D. thesis, The University of Melbourne (2011)"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.cor.2013.08.020","volume":"43","author":"TG Crainic","year":"2014","unstructured":"Crainic, T.G., Hewitt, M., Rei, W.: Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design. Comput. Oper. Res. 43, 90\u201399 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"23_CR10","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/s10601-008-9047-y","volume":"13","author":"AM Frisch","year":"2008","unstructured":"Frisch, A.M., Harvey, W., Jefferson, C., Mart\u00ednez-Hern\u00e1ndez, B., Miguel, I.: Essence: a constraint language for specifying combinatorial problems. Constraints 13(3), 268\u2013306 (2008)","journal-title":"Constraints"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/11682462_50","volume-title":"LATIN 2006: Theoretical Informatics","author":"M Goemans","year":"2006","unstructured":"Goemans, M., Vondr\u00e1k, J.: Stochastic covering and adaptivity. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 532\u2013543. Springer, Heidelberg (2006). doi:\n10.1007\/11682462_50"},{"key":"23_CR12","unstructured":"Hokama, P., San Felice, M.C., Bracht, E.C., Usberti, F.L.: A heuristic approach for the stochastic steiner tree problem (2014)"},{"issue":"6","key":"23_CR13","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s10732-008-9076-0","volume":"15","author":"LM Hvattum","year":"2009","unstructured":"Hvattum, L.M., L\u00f8kketangen, A.: Using scenario trees and progressive hedging for stochastic inventory routing problems. J. Heuristics 15(6), 527\u2013557 (2009)","journal-title":"J. Heuristics"},{"key":"23_CR14","unstructured":"Manandhar, S., Tarim, A., Walsh, T.: Scenario-based stochastic constraint programming. arXiv preprint \narXiv:0905.3763\n\n (2009)"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-74970-7_38"},{"issue":"3","key":"23_CR16","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation via lazy clause generation. Constraints 14(3), 357\u2013391 (2009)","journal-title":"Constraints"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-3-319-10428-7_46","volume-title":"Principles and Practice of Constraint Programming","author":"A Rendl","year":"2014","unstructured":"Rendl, A., Tack, G., Stuckey, P.J.: Stochastic MiniZinc. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 636\u2013645. Springer, Cham (2014). doi:\n10.1007\/978-3-319-10428-7_46"},{"issue":"1","key":"23_CR18","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/moor.16.1.119","volume":"16","author":"RT Rockafellar","year":"1991","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. 16(1), 119\u2013147 (1991)","journal-title":"Math. Oper. Res."},{"key":"23_CR19","unstructured":"Ryan, K., Ahmed, S., Dey, S.S., Rajan, D.: Optimization driven scenario grouping (2016)"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Ryan, K., Rajan, D., Ahmed, S.: Scenario decomposition for 0\u20131 stochastic programs: improvements and asynchronous implementation. In: Parallel and Distributed Processing Symposium Workshops, pp. 722\u2013729. IEEE (2016)","DOI":"10.1109\/IPDPSW.2016.119"},{"key":"23_CR21","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611973594","volume-title":"Vehicle Routing: Problems, Methods, and Applications","author":"P Toth","year":"2014","unstructured":"Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications, vol. 18. Siam, Philadelphia (2014)"},{"issue":"4","key":"23_CR22","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10287-010-0125-4","volume":"8","author":"JP Watson","year":"2011","unstructured":"Watson, J.P., Woodruff, D.L.: Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems. Comput. Manage. Sci. 8(4), 355\u2013370 (2011)","journal-title":"Comput. Manage. Sci."}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59776-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T09:37:13Z","timestamp":1496137033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59776-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319597751","9783319597768"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59776-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}