Analysis and optimization of recruitment stocking problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1176129
- scientific article; zbMATH DE number 3993292
- Optimal stopping for dynamic recruitment problem with probabilistic loss of candidates
- An Application of Stochastic Programming with Weibull Distribution–Cluster Based Optimum Allocation of Recruitment in Manpower Planning
- A stochastic model for the expected time to recruitment in a single graded manpower system with two thresholds using univariate max policy
Cites work
- scientific article; zbMATH DE number 5076448 (Why is no real title available?)
- scientific article; zbMATH DE number 3548141 (Why is no real title available?)
- A representation for multinomial cumulative distribution functions
- An algorithm for computing rectangular multinomial probabilities
- Boole-Bonferroni Inequalities and Linear Programming
- Concavity and efficient points of discrete distributions in probabilistic programming.
- Counting the Integer Solutions of a Linear Equation with Unit Coefficients
- Discrete Optimization Via Marginal Analysis
- Efficient time/space algorithm to compute rectangular probabilities of multinomial, multivariate hypergeometric and multivariate Pólya distributions
- End-to-end drug supply management in multicenter trials
- Foundations of inventory management
- Large deviation asymptotics for occupancy problems.
- On Birthday, Collectors', Occupancy and Other Classical Urn Problems
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
- Optical switch dimensioning and the classical occupancy problem
- Performance evaluation of stochastic multi-echelon inventory systems: a survey
- Sharp Bounds on Probabilities Using Linear Programming
Cited in
(4)
This page was built for publication: Analysis and optimization of recruitment stocking problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828830)
