Our goal is to quickly find top $k$ lists of nodes with the largest degrees in large complex networks. If the adjacency list of the network is known (not often the case in complex networks), a deterministic algorithm to find a node with the largest degree requires an average complexity of $\mbox{O}(
This study investigates the impact of pharmacy policies on patient waiting time in the Chemotherapy Day Unit of the Netherland Cancer Institute - Antoni van Leeuwenhoek hospital (NKI-AVL). The project evaluated whether a reduction in waiting time resulting from medication orders being prepared in ad
In this short article I will discuss three papers written by Willem van Zwet with three different co-authors: Mathisca de Gunst, Marta Fiocco, and myself. Each of the papers focuses on one particular application: growth of the number of biological cells [3], spreading of an infection [7], and the op
Hospitals traditionally segregate resources into centralized functional departments such as diagnostic departments, ambulatory care centers, and nursing wards. In recent years this organizational model has been challenged by the idea that higher quality of care and efficiency in service delivery can
If ($C_n$) a Markov chain on a discrete state space $S$, a Markov chain ($C_n, M_n$) on the product space $S \times S$, the cat and mouse Markov chain, is constructed. The first coordinate of this Markov chain behaves like the original Markov chain and the second component changes only when both coo
We present a methodology to design appointment systems for outpatient clinics and diagnostic facilities that offer both walk-in and scheduled service. The developed blueprint for the appointment schedule prescribes the number of appointments to plan per day and the moment on the day to schedule the
We study a problem of quick detection of top-k Personalized PageRank (PPR) lists. This problem has a number of important applications such as finding local cuts in large graphs, estimation of similarity distance and person name disambiguation. We argue that two observations are important when findin
We prove the conjecture formulated in Litvak and Ejov (2009), that the trace of the fundamental matrix of a singularly perturbed Markov chain that corresponds to a stochastic policy feasible for a given graph is minimised at policies corresponding to Hamiltonian cycles.
With this note, we introduce a reference database for Operations Research and Management Science (OR/ MS) literature in health care, named ‘ORchestra’ [6]. ORchestra is available online and can be searched by both medical and OR/MS keywords.
We introduce the categorized reference database ORchestra, which is available online at http://www.utwente.nl/choir/orchestra/.
Go to page top
Go back to contents
Go back to site navigation