default search action
Maarten H. van der Vlerk
Person information
- affiliation: University of Groningen, Department of Operations, Netherlands
- 1961-2016
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j24]Krzysztof Postek
, Ward Romeijnders
An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information. Eur. J. Oper. Res. 274(2): 432-444 (2019) - 2018
- [j23]Niels van der Laan
Higher-order total variation bounds for expectations of periodic functions and simple integer recourse approximations. Comput. Manag. Sci. 15(3-4): 325-349 (2018) - 2017
- [j22]Ward Romeijnders
Assessing the Quality of Convex Approximations for Two-Stage Totally Unimodular Integer Recourse Models. INFORMS J. Comput. 29(2): 211-231 (2017) - 2016
- [j21]Ward Romeijnders
Total variation bounds on the expectation of periodic functions with applications to recourse approximations. Math. Program. 157(1): 3-46 (2016) - [j20]Ward Romeijnders
A Convex Approximation for Two-Stage Mixed-Integer Recourse Models with a Uniform Error Bound. SIAM J. Optim. 26(1): 426-447 (2016) - 2015
- [j19]Ward Romeijnders
Convex Approximations for Totally Unimodular Integer Recourse Models: A Uniform Error Bound. SIAM J. Optim. 25(1): 130-158 (2015) - 2013
- [j18]Maarten H. van der Vlerk:
Erratum to: Convex approximations for complete integer recourse models. Math. Program. 141(1-2): 601-602 (2013) - 2011
- [j17]Willem K. Klein Haneveld, Matthijs H. Streutker, Maarten H. van der Vlerk:
Collective adjustment of pension rights in ALM models. Comput. Manag. Sci. 8(1-2): 137-156 (2011) - 2010
- [j16]Willem K. Klein Haneveld, Matthijs H. Streutker, Maarten H. van der Vlerk:
An ALM model for pension funds using integrated chance constraints. Ann. Oper. Res. 177(1): 47-62 (2010) - [j15]Maarten H. van der Vlerk:
Convex approximations for a class of mixed-integer recourse models. Ann. Oper. Res. 177(1): 139-150 (2010)
2000 – 2009
- 2009
- [j14]Maria L. A. G. Cremers, Willem K. Klein Haneveld, Maarten H. van der Vlerk:
A two-stage model for a day-ahead paratransit planning problem. Math. Methods Oper. Res. 69(2): 323-341 (2009) - [r1]Maarten H. van der Vlerk:
Stochastic Programming with Simple Integer Recourse. Encyclopedia of Optimization 2009: 3795-3797 - 2008
- [c2]Maria L. A. G. Cremers, Joaquim A. S. Gromicho, Willem K. Klein Haneveld, Maarten H. van der Vlerk:
A dynamic service mechanic problem for a housing corporation. CTW 2008: 78-81 - 2006
- [j13]Willem K. Klein Haneveld, Maarten H. van der Vlerk:
Integrated Chance Constraints: Reduced Forms and an Algorithm. Comput. Manag. Sci. 3(4): 245-269 (2006) - [j12]Maria L. A. G. Cremers, Willem K. Klein Haneveld, Maarten H. van der Vlerk:
A Two-stage Model for a Day-ahead Paratransit Planning Problem. Electron. Notes Discret. Math. 25: 35 (2006) - [j11]Maria Albareda-Sambola
Exact solutions to a class of stochastic generalized assignment problems. Eur. J. Oper. Res. 173(2): 465-487 (2006) - [j10]Willem K. Klein Haneveld, Leen Stougie, Maarten H. van der Vlerk:
Simple integer recourse models: convexity and convex approximations. Math. Program. 108(2-3): 435-473 (2006) - [c1]Willem K. Klein Haneveld, Matthijs H. Streutker, Maarten H. van der Vlerk:
ALM Modeling for Dutch Pension Funds in an Era of Pension Reform. OR 2006: 601-606 - 2005
- [j9]Maarten H. van der Vlerk:
On multiple simple recourse models. Math. Methods Oper. Res. 62(2): 225-242 (2005) - [i1]Maarten H. van der Vlerk:
Modification of Recourse Data for Mixed-Integer Recourse Models. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [j8]Maarten H. van der Vlerk:
Convex approximations for complete integer recourse models. Math. Program. 99(2): 297-310 (2004) - 2002
- [j7]Arno Maatman, Caspar Schweigman, Arjan Ruijs, Maarten H. van der Vlerk:
Modeling Farmers' Response to Uncertain Rainfall in Burkina Faso: A Stochastic Programming Approach. Oper. Res. 50(3): 399-414 (2002)
1990 – 1999
- 1999
- [j6]Willem K. Klein Haneveld, Maarten H. van der Vlerk:
Stochastic integer programming: General models and algorithms. Ann. Oper. Res. 85: 39-57 (1999) - 1998
- [j5]Asgeir Tomasgard, Jan A. Audestad, Shane Dye, Leen Stougie, Maarten H. van der Vlerk, Stein W. Wallace:
Modelling aspects of distributed processingin telecommunication networks. Ann. Oper. Res. 82: 161-185 (1998) - [j4]Rüdiger Schultz, Leen Stougie, Maarten H. van der Vlerk:
Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions. Math. Program. 83: 229-252 (1998) - 1996
- [j3]Willem K. Klein Haneveld, Leen Stougie, Maarten H. van der Vlerk:
An algorithm for the construction of convex hulls in simple integer recourse programming. Ann. Oper. Res. 64(1): 67-81 (1996) - 1995
- [j2]Willem K. Klein Haneveld, Leen Stougie, Maarten H. van der Vlerk:
On the convex hull of the simple integer recourse objective function. Ann. Oper. Res. 56(1): 209-224 (1995) - 1993
- [j1]François V. Louveaux, Maarten H. van der Vlerk:
Stochastic programming with simple integer recourse. Math. Program. 61: 301-325 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: