default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoost Berkhout
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Joost Berkhout
, Bernd Heidergott, Paul Van Dooren:
Perturbation and Inverse Problems of Stochastic Matrices. SIAM J. Matrix Anal. Appl. 45(1): 553-584 (2024)- [j12]Joost Berkhout:
A New Simheuristics Procedure for Stochastic Combinatorial Optimization. Simul. Notes Eur. 34(3): 159-162 (2024) - 2023
- [j11]Yoram Clapper, Joost Berkhout, René Bekker, Dennis Moeke:
A model-based evolutionary algorithm for home health care scheduling. Comput. Oper. Res. 150: 106081 (2023) - [j10]N. A. Dieleman, Joost Berkhout, Bernd Heidergott:
A neural network approach to performance analysis of tandem lines: The value of analytical knowledge. Comput. Oper. Res. 152: 106124 (2023) - [j9]Mark Blokland, Robert D. van der Mei, J. F. J. Pruyn, Joost Berkhout:
Literature Survey on Automatic Pipe Routing. Oper. Res. Forum 4(2): 1-56 (2023) - 2021
- [j8]Joost Berkhout, Eric J. Pauwels, Rob van der Mei, Jan Stolze, Siem Broersen:
Short-term production scheduling with non-triangular sequence-dependent setup times and shifting production bottlenecks. Int. J. Prod. Res. 59(3): 727-751 (2021)
2010 – 2019
- 2019
- [j7]Joost Berkhout, Bernd Heidergott, Henry Lam, Yijie Peng:
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) - [j6]Joost Berkhout, Bernd Heidergott, Jennifer Sommer, Hans Daduna:
Robustness analysis of generalized Jackson network. Comput. Manag. Sci. 16(4): 697-714 (2019) - [j5]Joost Berkhout, Bernd Heidergott:
Analysis of Markov Influence Graphs. Oper. Res. 67(3): 892-904 (2019) - [j4]Joost Berkhout, Bernd Heidergott:
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) - 2018
- [j3]Joost Berkhout, Bernd Heidergott:
Ranking nodes in general networks: a Markov multi-chain approach. Discret. Event Dyn. Syst. 28(1): 3-33 (2018) - [c4]Elena Ranguelova, Eric J. Pauwels, Joost Berkhout:
Evaluating Layer-Wise Relevance Propagation Explainability Maps for Artificial Neural Networks. eScience 2018: 377-378 - 2017
- [j2]Jennifer Sommer, Joost Berkhout, Hans Daduna, Bernd Heidergott:
Analysis of Jackson networks with infinite supply and unreliable nodes. Queueing Syst. Theory Appl. 87(1-2): 181-207 (2017) - 2016
- [c3]Joost Berkhout:
Google's PageRank algorithm for ranking nodes in general networks. WODES 2016: 153-158 - 2015
- [j1]Joost Berkhout:
An accelerated stopping rule for the Nested Partition Hybrid Algorithm for discrete stochastic optimization. Discret. Event Dyn. Syst. 25(3): 441-452 (2015) - [c2]Joost Berkhout, Bernd Heidergott:
Efficient Algorithm for Computing the Ergodic Projector of Markov Multi-chains. ICCS 2015: 1818-1827 - 2014
- [c1]Joost Berkhout, Bernd Heidergott:
A Series Expansion Approach to Risk Analysis of an Inventory System with Sourcing. WODES 2014: 510-515
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-23 00:28 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:
