default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarl-Heinz Waldmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j12]A. Lust, Karl-Heinz Waldmann:
A general storage model with applications to energy systems. OR Spectr. 41(1): 71-97 (2019)- 2011
- [p3]Christoph Stadtfeld, Andreas Geyer-Schulz, Karl-Heinz Waldmann:
Estimating Event-based Exponential Random Graph Models. Information Management and Market Engineering Vol. II 2011: 79-98
2000 – 2009
- 2007
- [j11]Christiane Barz
, Karl-Heinz Waldmann:
Risk-sensitive capacity control in revenue management. Math. Methods Oper. Res. 65(3): 565-579 (2007) - [e1]Karl-Heinz Waldmann, Ulrike M. Stocker:
Operations Research, Proceedings 2006, Selected Papers of the Annual International Conference of the German Operations ResearchSociety (GOR), Jointly Organized with the Austrian Society of Operations Research (ÖGOR) and the Swiss Society of Operations Research (SVOR), Karlsruhe, Germany, September 6-8, 2006. 2007, ISBN 978-3-540-69994-1 [contents] - 2006
- [p2]Karl-Heinz Waldmann:
On Markov decision models with an absorbing set. Decision Theory and Multi-Agent Planning 2006: 145-163 - 2005
- [j10]Karl Hinderer, Karl-Heinz Waldmann:
Algorithms for Countable State Markov Decision Models with an Absorbing Set. SIAM J. Control. Optim. 43(6): 2109-2131 (2005) - [p1]Karl-Heinz Waldmann:
On Variability of Optimal Policies in Markov Decision Processes. Data Analysis and Decision Support 2005: 177-185 - 2004
- [j9]Stefan Helber, Karl-Heinz Waldmann:
Editorial - Call Center Management. OR Spectr. 26(3): 305 (2004) - 2003
- [j8]Karl Hinderer, Karl-Heinz Waldmann:
The critical discount factor for finite Markovian decision processes with an absorbing set. Math. Methods Oper. Res. 57(1): 1-19 (2003) - 2001
- [j7]Karl Hinderer, Karl-Heinz Waldmann:
Cash management in a randomly varying environment. Eur. J. Oper. Res. 130(3): 468-485 (2001)
1990 – 1999
- 1998
- [j6]Karl-Heinz Waldmann:
On granting credit in a random environment. Math. Methods Oper. Res. 47(1): 99-115 (1998)
1980 – 1989
- 1985
- [j5]Karl-Heinz Waldmann:
On Bounds for Dynamic Programs. Math. Oper. Res. 10(2): 220-232 (1985) - 1981
- [j4]Karl-Heinz Waldmann:
Approximations of inventory models. Z. Oper. Research 25(5): 143-157 (1981) - 1980
- [j3]Karl-Heinz Waldmann:
On the optimality of (z, Z)-order-policies in adaptive inventory control. Z. Oper. Research 24(1): 61-67 (1980)
1970 – 1979
- 1979
- [j2]Karl-Heinz Waldmann:
Numerical aspects in Bayesian inventory control. Z. Oper. Research 23(1): 49-60 (1979) - 1977
- [j1]Joachim Gwinner, H. Läpple, Christoph Schneeweiss, Hans G. Bartels, Egon F. Kasper, Karl-Heinz Waldmann, Reiner Horst, R. Hebel, Helmuth Späth:
Buchbesprechungen. Math. Methods Oper. Res. 21(4): B159-B164 (1977)
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 2025-01-09 13:25 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:
