{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T18:27:31Z","timestamp":1693852051061},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T00:00:00Z","timestamp":1536192000000},"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":["Comput Manag Sci"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10287-018-0335-8","type":"journal-article","created":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T04:16:37Z","timestamp":1536207397000},"page":"319-323","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The stochastic programming heritage of Maarten van der Vlerk"],"prefix":"10.1007","volume":"15","author":[{"given":"David P.","family":"Morton","sequence":"first","affiliation":[]},{"given":"Ward","family":"Romeijnders","sequence":"additional","affiliation":[]},{"given":"R\u00fcdiger","family":"Schultz","sequence":"additional","affiliation":[]},{"given":"Leen","family":"Stougie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,6]]},"reference":[{"key":"335_CR1","doi-asserted-by":"publisher","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 MH, Fern\u00e1ndez E (2006) Exact solutions to a class of stochastic generalized assignment problems. Eur J Oper Res 173:465\u2013487","journal-title":"Eur J Oper Res"},{"key":"335_CR2","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s00186-008-0262-5","volume":"69","author":"MLAG Cremers","year":"2009","unstructured":"Cremers MLAG, Klein Haneveld WK, van der Vlerk MH (2009) A two-stage model for a day-ahead paratransit planning problem. Math Methods Oper Res 69:323\u2013341","journal-title":"Math Methods Oper Res"},{"key":"335_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10287-005-0007-3","volume":"3","author":"WK Klein Haneveld","year":"2006","unstructured":"Klein Haneveld WK, van der Vlerk MH (2006) Integrated chance constraints: reduced forms and an algorithm. Comput Manag Sci 3:245\u2013269","journal-title":"Comput Manag Sci"},{"key":"335_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02031708","volume":"56","author":"WK Klein Haneveld","year":"1995","unstructured":"Klein Haneveld WK, Stougie L, van der Vlerk MH (1995) On the convex hull of the simple integer recourse objective function. Ann Oper Res 56:209\u2013224","journal-title":"Ann Oper Res"},{"key":"335_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02187641","volume":"64","author":"WK Klein Haneveld","year":"1996","unstructured":"Klein Haneveld WK, Stougie L, van der Vlerk MH (1996) An algorithm for the construction of the convex hull of the simple integer recourse objective function. Ann Oper Res 64:67\u201381","journal-title":"Ann Oper Res"},{"key":"335_CR6","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10107-006-0718-4","volume":"108","author":"WK Klein Haneveld","year":"2006","unstructured":"Klein Haneveld WK, Stougie L, van der Vlerk MH (2006) Simple integer recourse models: convexity and convex approximations. Math Program 108:435\u2013473","journal-title":"Math Program"},{"key":"335_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10287-009-0111-x","volume":"8","author":"WK Klein Haneveld","year":"2011","unstructured":"Klein Haneveld WK, Streutker MH, van der Vlerk MH (2011) Collective adjustment of pension rights in ALM models. Comput Manag Sci 8:137\u2013156","journal-title":"Comput Manag Sci"},{"key":"335_CR8","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01582153","volume":"61","author":"F Louveaux","year":"1993","unstructured":"Louveaux F, van der Vlerk MH (1993) Stochastic programming with simple integer recourse. Math Program 61:301\u2013325","journal-title":"Math Program"},{"key":"335_CR9","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.50.3.399.7749","volume":"50","author":"A Maatman","year":"2002","unstructured":"Maatman A, Schweigman C, Ruijs A, van der Vlerk MH (2002) Modeling farmers\u2019 response to uncertain rainfall in Burkina Faso: a stochastic programming approach. Oper Res 50:399\u2013414","journal-title":"Oper Res"},{"key":"335_CR10","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1137\/130945703","volume":"25","author":"W Romeijnders","year":"2015","unstructured":"Romeijnders W, van der Vlerk MH, Klein Haneveld WK (2015) Convex approximations for totally unimodular integer recourse models: a uniform error bound. SIAM J Optim 25:130\u2013158","journal-title":"SIAM J Optim"},{"key":"335_CR11","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1137\/140986244","volume":"26","author":"W Romeijnders","year":"2016","unstructured":"Romeijnders W, Schultz R, van der Vlerk MH, Klein Haneveld WK (2016a) A convex approximation for two-stage mixed-integer recourse models with a uniform error bound. SIAM J Optim 26:426\u2013447","journal-title":"SIAM J Optim"},{"key":"335_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-014-0829-2","volume":"157","author":"W Romeijnders","year":"2016","unstructured":"Romeijnders W, van der Vlerk MH, Klein Haneveld WK (2016b) Total variation bounds on the expectation of periodic functions with applications to recourse approximations. Math Program 157:3\u201346","journal-title":"Math Program"},{"key":"335_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1287\/ijoc.2016.0725","volume":"29","author":"W Romeijnders","year":"2017","unstructured":"Romeijnders W, Morton DP, van der Vlerk MH (2017) Assessing the quality of convex approximations for two-stage totally unimodular integer recourse models. INFORMS J Comput 29:211\u2013231","journal-title":"INFORMS J Comput"},{"key":"335_CR14","first-page":"229","volume":"83","author":"R Schultz","year":"1998","unstructured":"Schultz R, Stougie L, van der Vlerk MH (1998) Solving stochastic integer programs by enumeration: a framework using Gr\u00f6bner basis reductions. Math Program 83:229\u2013252","journal-title":"Math Program"},{"key":"335_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1018902417700","volume":"82","author":"A Tomasgard","year":"1998","unstructured":"Tomasgard A, Audestad JA, Dye S, Stougie L, van der Vlerk MH, Wallace SW (1998) Modelling aspects of distributed processing in telecommunication networks. Ann Oper Res 82:161\u2013184","journal-title":"Ann Oper Res"},{"key":"335_CR16","unstructured":"van der Vlerk MH (1995) Stochastic programming with integer recourse, Thesis Rijksuniversiteit Groningen, Theses on Systems, Organisations, and Management. Labyrint Publications, Capelle a\/d Ijssel"},{"key":"335_CR17","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10107-003-0434-2","volume":"99","author":"MH Vlerk van der","year":"2004","unstructured":"van der Vlerk MH (2004) Convex approximations for complete integer recourse models. Math Program 99:297\u2013310","journal-title":"Math Program"},{"key":"335_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10479-009-0591-7","volume":"177","author":"MH Vlerk van der","year":"2010","unstructured":"van der Vlerk MH (2010) Convex approximations for a class of mixed-integer recourse models. Ann Oper Res 177:139\u2013150","journal-title":"Ann Oper Res"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-018-0335-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-018-0335-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-018-0335-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T19:12:44Z","timestamp":1567710764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-018-0335-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,6]]},"references-count":18,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["335"],"URL":"https:\/\/doi.org\/10.1007\/s10287-018-0335-8","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,6]]},"assertion":[{"value":"6 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}