![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Willem K. Klein Haneveld
Person information
- affiliation: University of Groningen, Groningen, The Netherlands
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j22]Ward Romeijnders
, Maarten H. van der Vlerk, Willem K. Klein Haneveld:
Total variation bounds on the expectation of periodic functions with applications to recourse approximations. Math. Program. 157(1): 3-46 (2016) - [j21]Ward Romeijnders
, Rüdiger Schultz, Maarten H. van der Vlerk, Willem K. Klein Haneveld:
A Convex Approximation for Two-Stage Mixed-Integer Recourse Models with a Uniform Error Bound. SIAM J. Optim. 26(1): 426-447 (2016) - 2015
- [j20]Ward Romeijnders
, Maarten H. van der Vlerk, Willem K. Klein Haneveld:
Convex Approximations for Totally Unimodular Integer Recourse Models: A Uniform Error Bound. SIAM J. Optim. 25(1): 130-158 (2015) - 2011
- [j19]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
- [j18]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)
2000 – 2009
- 2009
- [j17]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) - 2008
- [j16]Ruud H. Teunter
, Willem K. Klein Haneveld:
Dynamic inventory rationing strategies for inventory systems with two demand classes, Poisson demand and backordering. Eur. J. Oper. Res. 190(1): 156-178 (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
- [j15]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) - [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. Electron. Notes Discret. Math. 25: 35 (2006) - [j13]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
- [j12]Willem K. Klein Haneveld, A. W. Stegeman:
Crop succession requirements in agricultural production planning. Eur. J. Oper. Res. 166(2): 406-429 (2005) - 2002
- [j11]Ruud H. Teunter, Willem K. Klein Haneveld:
Inventory control of service parts in the final phase. Eur. J. Oper. Res. 137(3): 497-511 (2002) - [j10]Ruud H. Teunter, Willem K. Klein Haneveld:
Inventory control of service parts in the final phase: A central depot and repair kits. Eur. J. Oper. Res. 138(1): 76-86 (2002)
1990 – 1999
- 1999
- [j9]Willem K. Klein Haneveld, Maarten H. van der Vlerk:
Stochastic integer programming: General models and algorithms. Ann. Oper. Res. 85: 39-57 (1999) - [j8]Igor V. Evstigneev, Willem K. Klein Haneveld, Leonard J. Mirman:
Robust insurance mechanisms and the shadow prices of information constraints. Adv. Decis. Sci. 3(1): 85-128 (1999) - 1998
- [j7]Ruud H. Teunter, Willem K. Klein Haneveld:
The 'final orderrs problem. Eur. J. Oper. Res. 107(1): 35-44 (1998) - 1996
- [j6]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
- [j5]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) - [j4]Douwe-Frits Broens, Willem K. Klein Haneveld:
Investment evaluation based on the commercial scope the production of natural gas. Ann. Oper. Res. 59(1): 195-226 (1995)
1980 – 1989
- 1980
- [j3]Willem K. Klein Haneveld:
On the Behavior of the Optimal Value Operator of Dynamic Programming. Math. Oper. Res. 5(2): 308-320 (1980)
1970 – 1979
- 1979
- [j2]Willem K. Klein Haneveld, C. L. J. van der Meer, R. J. Peters:
A construction method in parametric programming. Math. Program. 16(1): 21-36 (1979) - 1975
- [j1]Jacob Ponstein, Willem K. Klein Haneveld:
On a general saddle-point condition in normed spaces. Math. Program. 9(1): 118-122 (1975)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint