Analysis and optimization of recruitment stocking problems
From MaRDI portal
Publication:828830
DOI10.1007/s10479-020-03822-2zbMath1467.90003OpenAlexW3091848949MaRDI QIDQ828830
Yao Zhao, Anh Ninh, Benjamin Melamed
Publication date: 5 May 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-020-03822-2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
- Performance evaluation of stochastic multi-echelon inventory systems: a survey
- Efficient time/space algorithm to compute rectangular probabilities of multinomial, multivariate hypergeometric and multivariate Pólya distributions
- A representation for multinomial cumulative distribution functions
- Large deviation asymptotics for occupancy problems.
- End-to-end drug supply management in multicenter trials
- Sharp Bounds on Probabilities Using Linear Programming
- An algorithm for computing rectangular multinomial probabilities
- On Birthday, Collectors', Occupancy and Other Classical Urn Problems
- Boole-Bonferroni Inequalities and Linear Programming
- Counting the Integer Solutions of a Linear Equation with Unit Coefficients
- Optical switch dimensioning and the classical occupancy problem
- Discrete Optimization Via Marginal Analysis
- Concavity and efficient points of discrete distributions in probabilistic programming.
