Pages that link to "Item:Q4868808"
From MaRDI portal
The following pages link to One-Attribute Sequential Assignment Match Processes in Discrete Time (Q4868808):
Displaying 11 items.
- A generalized coupon collecting model as a parsimonious optimal stochastic assignment model (Q378733) (← links)
- Dynamic allocation of stochastically-arriving flexible resources to random streams of objects with application to kidney cross-transplantation (Q1681335) (← links)
- Triply stochastic sequential assignment problem with the uncertainty in worker survival (Q2080838) (← links)
- Benchmark policies for utility-carrying queues with impatience (Q2210664) (← links)
- A double-ended queueing model for dynamic allocation of live organs based on a best-fit criterion (Q2295919) (← links)
- A sequential assignment match process with general renewal arrival times (Q2805370) (← links)
- Stochastic sequential assignment problem with arrivals (Q2884250) (← links)
- Technical Note—A Stochastic Assignment Problem with Unknown Eligibility Probabilities (Q4994154) (← links)
- Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model (Q5322103) (← links)
- Location of organ procurement and distribution organisation decisions and their impact on kidney allocations: a developing country perspective (Q6099427) (← links)
- Applications of fluid models in service operations management (Q6163558) (← links)