{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:40:57Z","timestamp":1742913657968,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030300470"},{"type":"electronic","value":"9783030300487"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-30048-7_40","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T23:03:06Z","timestamp":1569193386000},"page":"690-708","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting Counterfactuals for Scalable Stochastic Optimization"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Kuhlemann","sequence":"first","affiliation":[]},{"given":"Meinolf","family":"Sellmann","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Tierney","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"40_CR1","unstructured":"April, J., Glover, F., Kelly, J.P., Laguna, M.: Practical introduction to simulation optimization. In: Proceedings of the 35th Conference on Winter Simulation: Driving Innovation, pp. 71\u201378. Winter Simulation Conference (2003)"},{"key":"40_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-13520-0_34","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T Berthold","year":"2010","unstructured":"Berthold, T., Heinz, S., L\u00fcbbecke, M.E., M\u00f6hring, R.H., Schulz, J.: A constraint integer programming approach for resource-constrained project scheduling. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 313\u2013317. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13520-0_34"},{"issue":"5","key":"40_CR3","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1287\/opre.33.5.989","volume":"33","author":"JR Birge","year":"1985","unstructured":"Birge, J.R.: Decomposition and partitioning methods for multistage stochastic linear programs. Oper. Res. 33(5), 989\u20131007 (1985)","journal-title":"Oper. Res."},{"key":"40_CR4","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-1-4614-0237-4"},{"issue":"6","key":"40_CR5","doi-asserted-by":"publisher","first-page":"1688","DOI":"10.1109\/TITS.2015.2498160","volume":"17","author":"Z Cao","year":"2015","unstructured":"Cao, Z., Guo, H., Zhang, J., Niyato, D., Fastenrath, U.: Finding the shortest path in stochastic vehicle routing: a cardinality minimization approach. IEEE Trans. Intell. Transp. Syst. 17(6), 1688\u20131702 (2015)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"4","key":"40_CR6","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1287\/moor.1080.0330","volume":"33","author":"BC Dean","year":"2008","unstructured":"Dean, B.C., Goemans, M.X., Vondr\u00e1k, J.: Approximating the stochastic knapsack problem: the benefit of adaptivity. Math. Oper. Res. 33(4), 945\u2013964 (2008)","journal-title":"Math. Oper. Res."},{"issue":"1\u20134","key":"40_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1019206915174","volume":"100","author":"J Dupa\u010dov\u00e1","year":"2000","unstructured":"Dupa\u010dov\u00e1, J., Consigli, G., Wallace, S.W.: Scenarios for multistage stochastic programs. Ann. Oper. Res. 100(1\u20134), 25\u201353 (2000)","journal-title":"Ann. Oper. Res."},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs. I. Publicationes Mathematicae (Debrecen) 6, 290\u2013297 (1959)","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"40_CR9","unstructured":"Fu, M.C., Glover, F.W., April, J.: Simulation optimization: a review, new developments, and applications. In: Proceedings of the Winter Simulation Conference, p. 13. IEEE (2005)"},{"key":"40_CR10","unstructured":"Glover, F., Kelly, J., Laguna, M.: New advances for wedding optimization and simulation. In: Winter Simulation Conference 1999 Proceedings, vol. 1, pp. 255\u2013260. IEEE (1999)"},{"key":"40_CR11","unstructured":"Google: Google OR-Tools (2019). developers.google.com\/optimization\/"},{"issue":"1","key":"40_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10479-006-0140-6","volume":"152","author":"R Hochreiter","year":"2007","unstructured":"Hochreiter, R., Pflug, G.C.: Financial scenario generation for stochastic multi-stage decision processes as facility location problems. Ann. OR 152(1), 257\u2013272 (2007)","journal-title":"Ann. OR"},{"issue":"2","key":"40_CR13","first-page":"257","volume":"3","author":"M Kaut","year":"2007","unstructured":"Kaut, M., Wallace, S.W.: Evaluation of scenario-generation methods for stochastic programming. Pac. J. Optim. 3(2), 257\u2013271 (2007)","journal-title":"Pac. J. Optim."},{"issue":"2","key":"40_CR14","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"AJ Kleywegt","year":"2002","unstructured":"Kleywegt, A.J., Shapiro, A., Homem-de Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Opt. 12(2), 479\u2013502 (2002)","journal-title":"SIAM J. Opt."},{"issue":"1","key":"40_CR15","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., Sprecher, A.: PSPLIB-a project scheduling problem library. Eur. J. Oper. Res. 96(1), 205\u2013216 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"40_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ejor.2012.04.018","volume":"222","author":"Y Long","year":"2012","unstructured":"Long, Y., Lee, L.H., Chew, E.P.: The sample average approximation method for empty container repositioning with uncertainties. Eur. J. Oper. Res. 222(1), 65\u201375 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"40_CR17","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1287\/inte.2015.0803","volume":"45","author":"X Luo","year":"2015","unstructured":"Luo, X., Dashora, Y., Shaw, T.: Airline crew augmentation: decades of improvements from sabre. INFORMS J. Appl. Anal. 45(5), 409\u2013424 (2015)","journal-title":"INFORMS J. Appl. Anal."},{"key":"40_CR18","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm portfolios based on cost-sensitive hierarchical clustering. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), Beijing, China, 2013, pp. 608\u2013614 (2013)"},{"key":"40_CR19","unstructured":"Pelikan, M., Goldberg, D.E., Cant\u00fa-Paz, E.: BOA: the Bayesian optimization algorithm. In: Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation-Volume 1, pp. 525\u2013532. Morgan Kaufmann Publishers Inc. (1999)"},{"issue":"2","key":"40_CR20","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ejor.2008.11.040","volume":"199","author":"P Sch\u00fctz","year":"2009","unstructured":"Sch\u00fctz, P., Tomasgard, A., Ahmed, S.: Supply chain design under uncertainty using sample average approximation and dual decomposition. Eur. J. Oper. Res. 199(2), 409\u2013419 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"40_CR21","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"RM Slyke Van","year":"1969","unstructured":"Van Slyke, R.M., Wets, R.: L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17(4), 638\u2013663 (1969)","journal-title":"SIAM J. Appl. Math."},{"issue":"2\u20133","key":"40_CR22","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1021814225969","volume":"24","author":"B Verweij","year":"2003","unstructured":"Verweij, B., Ahmed, S., Kleywegt, A.J., Nemhauser, G., Shapiro, A.: The sample average approximation method applied to stochastic routing problems: a computational study. Comput. Optim. Appl. 24(2\u20133), 289\u2013333 (2003)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"40_CR23","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1090\/qam\/253822","volume":"27","author":"JY Yen","year":"1970","unstructured":"Yen, J.Y.: An algorithm for finding shortest routes from all source nodes to a given destination in general networks. Q. Appl. Math. 27(4), 526\u2013530 (1970)","journal-title":"Q. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30048-7_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T16:40:51Z","timestamp":1695228051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30048-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030300470","9783030300487"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30048-7_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stamford, CT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cp2019.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"118","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}