default search action
Bernd Heidergott
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j46]Joost Berkhout
, Bernd Heidergott
Perturbation and Inverse Problems of Stochastic Matrices. SIAM J. Matrix Anal. Appl. 45(1): 553-584 (2024) - [i1]Christian P. C. Franssen, Alessandro Zocca, Bernd F. Heidergott:
A First-Order Gradient Approach for the Connectivity Analysis of Weighted Graphs. CoRR abs/2403.11744 (2024) - 2023
- [j45]N. A. Dieleman
A neural network approach to performance analysis of tandem lines: The value of analytical knowledge. Comput. Oper. Res. 152: 106124 (2023) - 2022
- [j44]Warren Volk-Makarewicz, Svetlana Borovkova, Bernd Heidergott
Assessing the impact of jumps in an option pricing model: A gradient estimation approach. Eur. J. Oper. Res. 298(2): 740-751 (2022) - [j43]Yijie Peng
A New Likelihood Ratio Method for Training Artificial Neural Networks. INFORMS J. Comput. 34(1): 638-655 (2022) - [c15]Kim van den Houten, Emile van Krieken
Analysis of Measure-Valued Derivatives in a Reinforcement Learning Actor-Critic Framework. WSC 2022: 2736-2747 - 2021
- [j42]Katia Bachi
Statistical Taylor series expansion: An approach for epistemic uncertainty propagation in Markov reliability models. RAIRO Oper. Res. 55(Supplement): S593-S624 (2021) - 2020
- [j41]Michael C. Fu, Bernd Heidergott
Differentiation via Logarithmic Expansions. Asia Pac. J. Oper. Res. 37(1): 1950034:1-1950034:13 (2020) - [j40]Yijie Peng
Maximum Likelihood Estimation by Monte Carlo Simulation: Toward Data-Driven Stochastic Modeling. Oper. Res. 68(6): 1896-1912 (2020)
2010 – 2019
- 2019
- [j39]Joost Berkhout
From Data to Stochastic Modeling and Decision Making: What Can We Do Better? Asia Pac. J. Oper. Res. 36(6): 1940012:1-1940012:20 (2019) - [j38]Joost Berkhout
Robustness analysis of generalized Jackson network. Comput. Manag. Sci. 16(4): 697-714 (2019) - [j37]Joost Berkhout
Analysis of Markov Influence Graphs. Oper. Res. 67(3): 892-904 (2019) - [j36]Joost Berkhout
The Jump Start Power Method: A New Approach for Computing the Ergodic Projector of a Finite Markov Chain. J. Sci. Comput. 78(3): 1691-1723 (2019) - [j35]Jia-Ping Huang, Bernd Heidergott
Naïve learning in social networks with random communication. Soc. Networks 58: 1-11 (2019) - [c14]Bowen Pang, Xiaolei Xie, Bernd Heidergott
optimizing outpatient Department Staffing Level using Multi-Fidelity Models. CASE 2019: 715-720 - [c13]Haidong Li, Yijie Peng, Xiaoyun Xu, Chun-Hung Chen, Bernd Heidergott
Dynamic Sampling Procedure for Decomposable Random Networks. WSC 2019: 3752-3763 - 2018
- [j34]Joost Berkhout
Ranking nodes in general networks: a Markov multi-chain approach. Discret. Event Dyn. Syst. 28(1): 3-33 (2018) - [j33]Yijie Peng
A New Unbiased Stochastic Derivative Estimator for Discontinuous Sample Performances with Structural Parameters. Oper. Res. 66(2): 487-499 (2018) - 2017
- [j32]Jennifer Sommer, Joost Berkhout
Analysis of Jackson networks with infinite supply and unreliable nodes. Queueing Syst. Theory Appl. 87(1-2): 181-207 (2017) - 2016
- [j31]Jennifer Sommer, Hans Daduna, Bernd Heidergott
Nonergodic Jackson networks with infinite supply-local stabilization and local equilibrium analysis. J. Appl. Probab. 53(4): 1125-1142 (2016) - [j30]Bernd Heidergott
A Measure-Valued Differentiation Approach to Sensitivities of Quantiles. Math. Oper. Res. 41(1): 293-317 (2016) - 2015
- [j29]Wim Hordijk, Arie Hordijk, Bernd Heidergott
A Genetic Algorithm for Finding Good Balanced Sequences in a Customer Assignment Problem with no State Information. Asia Pac. J. Oper. Res. 32(3): 1550015:1-1550015:20 (2015) - [j28]Warren Volk-Makarewicz, Bernd Heidergott
Sensitivity analysis of ranked data: from order statistics to quantiles. Discret. Event Dyn. Syst. 25(4): 453-495 (2015) - [j27]Bernd Heidergott
A Smoothed Perturbation Analysis of Parisian Options. IEEE Trans. Autom. Control. 60(2): 469-474 (2015) - [c12]Joost Berkhout
Efficient Algorithm for Computing the Ergodic Projector of Markov Multi-chains. ICCS 2015: 1818-1827 - 2014
- [c11]Bernd Heidergott:
Towards a Statistical System Analysis. VECoS 2014: 16-17 - [c10]Bernd Heidergott
Non-Parametric Sensitivity Analysis of the Finite M/M/1 Queue. WODES 2014: 498-503 - [c9]Joost Berkhout
A Series Expansion Approach to Risk Analysis of an Inventory System with Sourcing. WODES 2014: 510-515 - 2013
- [j26]Karim Abbas, Bernd Heidergott
A functional approximation for the M/G/1/N queue. Discret. Event Dyn. Syst. 23(1): 93-104 (2013) - [j25]Haralambie Leahu, Bernd Heidergott
Perturbation analysis of waiting times in the G/G/1 queue. Discret. Event Dyn. Syst. 23(3): 277-305 (2013) - [c8]Sofiane Ouazine, Karim Abbas, Bernd Heidergott
The Taylor Series Expansions for Performance Functions of Queues: Sensitivity Analysis. ASMTA 2013: 1-11 - 2012
- [j24]Sandjai Bhulai
Optimal balanced control for call centers. Ann. Oper. Res. 201(1): 39-62 (2012) - 2011
- [j23]Rob M. P. Goverde, Bernd Heidergott
A coupling approach to estimating the Lyapunov exponent of stochastic max-plus linear systems. Eur. J. Oper. Res. 210(2): 249-257 (2011) - [r1]Arnoldo Frigessi, Bernd Heidergott:
Markov Chains. International Encyclopedia of Statistical Science 2011: 772-775 - 2010
- [j22]Bernd Heidergott
A Perturbation Analysis Approach to Phantom Estimators for Waiting Times in the G/G/1 Queue. Discret. Event Dyn. Syst. 20(2): 249-273 (2010) - [j21]Bernd Heidergott
Gradient Estimation for Multicomponent Maintenance Systems with Age-Replacement Policy. Oper. Res. 58(3): 706-718 (2010) - [j20]Bernd Heidergott
Series Expansions for Continuous-Time Markov Processes. Oper. Res. 58(3): 756-767 (2010) - [j19]Nicole Leder, Bernd Heidergott
An Approximation Approach for the Deviation Matrix of Continuous-Time Markov Processes with Application to Markov Decision Theory. Oper. Res. 58(4-Part-1): 918-932 (2010) - [j18]Bernd Heidergott
Weak Differentiability of Product Measures. Math. Oper. Res. 35(1): 27-51 (2010) - [j17]Bernd Heidergott
Gradient estimation for discrete-event systems by measure-valued differentiation. ACM Trans. Model. Comput. Simul. 20(1): 5:1-5:28 (2010) - [c7]Bernd Heidergott
Gradient estimation for quantiles of stationary waiting times. WODES 2010: 241-246 - [c6]Karim Abbas, Bernd Heidergott
A Taylor series approach to the numerical analysis of the M/D/1/N queue. ICCS 2010: 1553-1560
2000 – 2009
- 2009
- [j16]Bernd Heidergott
Strong bounds on perturbations. Math. Methods Oper. Res. 70(1): 99-127 (2009) - [j15]Bernd Heidergott
Gradient estimation for a class of systems with bulk services: A problem in public transportation. ACM Trans. Model. Comput. Simul. 19(3): 13:1-13:27 (2009) - [c5]Bernd Heidergott, Warren Volk-Makarewicz:
Quantile Sensitivity Estimation. NET-COOP 2009: 16-29 - 2008
- [j14]Bernd Heidergott
Sensitivity estimation for Gaussian systems. Eur. J. Oper. Res. 187(1): 193-207 (2008) - 2007
- [j13]Ton J. J. van den Boom, Bernd Heidergott
Complexity reduction in MPC for stochastic max-plus-linear discrete event systems by variability expansion. Autom. 43(6): 1058-1063 (2007) - [j12]Bernd Heidergott
A Note on Gradient Estimation for Maintenance Systems. IEEE Trans. Autom. Control. 52(11): 2141-2145 (2007) - 2006
- [j11]Bernd Heidergott
Measure-Valued Differentiation for Stationary Markov Chains. Math. Oper. Res. 31(1): 154-172 (2006) - 2005
- [c4]Haralambie Leahu, Bernd Heidergott
Series Expansions of Generalized Matrix Products. CDC/ECC 2005: 7793-7798 - 2004
- [j10]Bernd Heidergott
Single-run gradient estimation via measure-valued differentiation. IEEE Trans. Autom. Control. 49(10): 1843-1847 (2004) - 2003
- [j9]A. F. de Kort, Bernd Heidergott
A probabilistic (max, +) approach for determining railway infrastructure capacity. Eur. J. Oper. Res. 148(3): 644-661 (2003) - [c3]Bernd Heidergott:
A Paradigm for Derivatives of Positive Systems. POSTA 2003: 321-328 - 2002
- [j8]Bernd Heidergott
A note on the relation between weak derivatives and perturbation realization. IEEE Trans. Autom. Control. 47(7): 1112-1115 (2002) - [c2]Ton J. J. van den Boom, Bart De Schutter, Bernd Heidergott:
Complexity reduction in MPC for stochastic max-plus-linear systems by variability expansion. CDC 2002: 3567-3572 - 2001
- [j7]Bernd Heidergott
Towards a (Max, +) Control Theory for Public Transportation Networks. Discret. Event Dyn. Syst. 11(4): 371-398 (2001) - [j6]Bernd Heidergott
A Differential Calculus for Random Matrices with Applications to (max, +)-Linear Stochastic Systems. Math. Oper. Res. 26(4): 679-699 (2001) - 2000
- [j5]Bernd Heidergott
Customer-Oriented Finite Perturbation Analysis for Queueing Networks. Discret. Event Dyn. Syst. 10(3): 201-232 (2000) - [j4]Bernd Heidergott
Analysing sojourn times in queueing networks: A structural approach. Math. Methods Oper. Res. 52(1): 115-132 (2000) - [j3]Bernd Heidergott
A characterisation of (max-linear queueing systems. Queueing Syst. Theory Appl. 35(1-4): 237-262 (2000)
1990 – 1999
- 1999
- [j2]Bernd Heidergott
Optimisation of a single-component maintenance system: A smoothed perturbation analysis approach. Eur. J. Oper. Res. 119(1): 181-190 (1999) - [j1]Bernd Heidergott
Infinitesimal perturbation analysis for queueing networks with general service time distributions. Queueing Syst. Theory Appl. 31(1-2): 43-58 (1999) - 1996
- [b1]Bernd Heidergott:
Pfadanalyse stochastischer Netzwerke. University of Hamburg, Kovač 1996, ISBN 3-86064-086-0, pp. 1-311 - 1991
- [c1]Bernd Heidergott:
Sensitivitätsanalyse eines Fertigungssystems mit Hilfe der infinitesimalen Pertubationsanalyse (IPA). ASIM 1991: 139-145
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-09-12 03:30 CEST 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: