Bennett L. Fox

According to our database1, Bennett L. Fox
  • authored at least 31 papers between 1967 and 2002.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2002
Filtering the Feynman-KAC Formula.
SIAM J. Numerical Analysis, 2002

2000
Separability in Optimal Allocation.
Operations Research, 2000

1995
Faster Simulated Annealing.
SIAM Journal on Optimization, 1995

1994
Programs to generate Niederreiter's low-discrepancy sequences.
ACM Trans. Math. Softw., 1994

1993
Shortening Future-Event Lists.
INFORMS Journal on Computing, 1993

Integrating and accelerating tabu search, simulated annealing, and genetic algorithms.
Annals OR, 1993

1992
Implementation and Tests of Low Discrepancy Sequences.
ACM Trans. Model. Comput. Simul., 1992

Uniting Probabilistic Methods for Optimization.
Proceedings of the 24th Winter Simulation Conference, 1992

1991
Generating Markov-Chain Transitions Quickly: II.
INFORMS Journal on Computing, 1991

1990
Generating Markov-Chain Transitions Quickly: I.
INFORMS Journal on Computing, 1990

Alternative approaches for specifying input distributions and processes (panel session).
Proceedings of the 22th Winter Simulation Conference, 1990

1988
Algorithm 659: Implementing Sobol's quasirandom sequence generator.
ACM Trans. Math. Softw., 1988

Computing Poisson Probabilities.
Commun. ACM, 1988

1987
A guide to simulation, 2nd Edition.
Springer, ISBN: 0387964673, 1987

1986
Algorithm 647: Implementation and Relative Efficiency of Quasirandom Sequence Generators.
ACM Trans. Math. Softw., 1986

1983
Counterparts of variance reduction techniques for Quasi-Monte Carlo integration.
Proceedings of the 15th conference on Winter simulation, 1983

A guide to simulation.
Springer, ISBN: 354090820X, 1983

1982
Coupled Successive Approximations for Markov Programs.
Operations Research, 1982

Statistical issues in simulation research.
Proceedings of the 14th conference on Winter Simulation, 1982

1981
Fitting "standard" distributions to data is necessarily good: Dogma or myth?
Proceedings of the 13th conference on Winter simulation, 1981

1980
Technical Note - Enforcing Constraints on Expanded Networks.
Operations Research, 1980

1979
Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound.
Operations Research, 1979

Shortest-Route Methods: 1. Reaching, Pruning, and Buckets.
Operations Research, 1979

1978
Data Structures and Computer Science Techniques in Operations Research.
Operations Research, 1978

1975
More on kth Shortest Paths.
Commun. ACM, 1975

1973
Reducing the Number of Multiplikations in Iterative Processes.
Acta Inf., 1973

1970
Accelerating List Processing in Discrete Programming.
J. ACM, 1970

Searching for the Multiplier in One-Constraint Optimization Problems.
Operations Research, 1970

1969
Accelerating LP algorithms.
Commun. ACM, 1969

1968
Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix.
Commun. ACM, 1968

1967
Letter to the Editor - Nonoptimality of Planned Replacement in Intervals of Decreasing Failure Rate.
Operations Research, 1967


  Loading...