Letter to the Editor - Nonoptimality of Planned Replacement in Intervals of Decreasing Failure Rate. - Eric V. Denardo; Bennett L. Fox (Oper. Res., 1967)

Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix. - Bennett L. Fox; D. M. Landi (Commun. ACM, 1968)

Accelerating LP algorithms. - Bennett L. Fox (Commun. ACM, 1969)

Searching for the Multiplier in One-Constraint Optimization Problems. - Bennett L. Fox; D. M. Landi (Oper. Res., 1970)

Accelerating List Processing in Discrete Programming. - Bennett L. Fox (J. ACM, 1970)

Reducing the Number of Multiplikations in Iterative Processes. - Bennett L. Fox (Acta Informatica, 1973)

More on kth Shortest Paths. - Bennett L. Fox (Commun. ACM, 1975)

Data Structures and Computer Science Techniques in Operations Research. - Bennett L. Fox (Oper. Res., 1978)

Shortest-Route Methods: 1. Reaching, Pruning, and Buckets. - Eric V. Denardo; Bennett L. Fox (Oper. Res., 1979)

Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound. - Eric V. Denardo; Bennett L. Fox (Oper. Res., 1979)

Technical Note - Enforcing Constraints on Expanded Networks. - Eric V. Denardo; Bennett L. Fox (Oper. Res., 1980)

Fitting "standard" distributions to data is necessarily good: Dogma or myth? - Bennett L. Fox (WSC, 1981)

Statistical issues in simulation research. - Bruce W. Schmeiser; Bennett L. Fox; Peter A. W. Lewis; Andrew F. Seila; James R. Wilson (WSC, 1982)

Coupled Successive Approximations for Markov Programs. - Bennett L. Fox (Oper. Res., 1982)

A guide to simulation. - Paul Bratley; Bennett L. Fox; Linus E. Schrage (Springer, 1983)

Counterparts of variance reduction techniques for Quasi-Monte Carlo integration. - Bennett L. Fox (WSC, 1983)

Algorithm 647: Implementation and Relative Efficiency of Quasirandom Sequence Generators. - Bennett L. Fox (ACM Trans. Math. Softw., 1986)

A guide to simulation, 2nd Edition. - Paul Bratley; Bennett L. Fox; Linus Schrage (Springer, 1987)

Computing Poisson Probabilities. - Bennett L. Fox; Peter W. Glynn (Commun. ACM, 1988)

Algorithm 659: Implementing Sobol's quasirandom sequence generator. - Paul Bratley; Bennett L. Fox (ACM Trans. Math. Softw., 1988)

Alternative approaches for specifying input distributions and processes (panel session). - W. David Kelton; Bennett L. Fox; Mark E. Johnson; Averill M. Law; Bruce W. Schmeiser; James R. Wilson; John Meszaros; Cynthia L. Morey; Susan E. Romens (WSC, 1990)

Generating Markov-Chain Transitions Quickly: I. - Bennett L. Fox (INFORMS J. Comput., 1990)

Generating Markov-Chain Transitions Quickly: II. - Bennett L. Fox; Andrew R. Young (INFORMS J. Comput., 1991)

Spaced batch means. - Bennett L. Fox; David Goldsman; James J. Swain (Oper. Res. Lett., 1991)

Uniting Probabilistic Methods for Optimization. - Bennett L. Fox (WSC, 1992)

Implementation and Tests of Low Discrepancy Sequences. - Paul Bratley; Bennett L. Fox; Harald Niederreiter (ACM Trans. Model. Comput. Simul., 1992)

Integrating and accelerating tabu search, simulated annealing, and genetic algorithms. - Bennett L. Fox (Ann. Oper. Res., 1993)

Shortening Future-Event Lists. - Bennett L. Fox (INFORMS J. Comput., 1993)

Programs to generate Niederreiter's low-discrepancy sequences. - Paul Bratley; Bennett L. Fox; Harald Niederreiter (ACM Trans. Math. Softw., 1994)

Faster Simulated Annealing. - Bennett L. Fox (SIAM J. Optim., 1995)

Separability in Optimal Allocation. - Bennett L. Fox (Oper. Res., 2000)

Filtering the Feynman-KAC Formula. - Bennett L. Fox (SIAM J. Numer. Anal., 2002)