Bennett L. Fox

1938

• How to store it
• Strategies for quasi-Monte Carlo
• Adaptive policies for Markov renewal programs
• Calculating k-th shortest paths
• Discrete optimization via marginal analysis
• Discrete programming applications of techniques for handling a common list structure
• Markov renewal programming by linear fractional programming
• Optimization problems with one constraint
• Semi-Markov processes