default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBennett L. Fox
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[j25]Bennett L. Fox:
Filtering the Feynman-KAC Formula. SIAM J. Numer. Anal. 39(6): 2179-2199 (2002)- 2000
- [j24]Bennett L. Fox:
Separability in Optimal Allocation. Oper. Res. 48(1): 173-176 (2000)
1990 – 1999
- 1995
- [j23]Bennett L. Fox:
Faster Simulated Annealing. SIAM J. Optim. 5(3): 488-505 (1995) - 1994
- [j22]Paul Bratley, Bennett L. Fox, Harald Niederreiter:
Programs to generate Niederreiter's low-discrepancy sequences. ACM Trans. Math. Softw. 20(4): 494-495 (1994) - 1993
- [j21]Bennett L. Fox:
Integrating and accelerating tabu search, simulated annealing, and genetic algorithms. Ann. Oper. Res. 41(2): 47-67 (1993) - [j20]Bennett L. Fox:
Shortening Future-Event Lists. INFORMS J. Comput. 5(2): 147-150 (1993) - 1992
- [j19]Paul Bratley, Bennett L. Fox, Harald Niederreiter:
Implementation and Tests of Low Discrepancy Sequences. ACM Trans. Model. Comput. Simul. 2(3): 195-213 (1992) - [c5]Bennett L. Fox:
Uniting Probabilistic Methods for Optimization. WSC 1992: 500-505 - 1991
- [j18]Bennett L. Fox, Andrew R. Young:
Generating Markov-Chain Transitions Quickly: II. INFORMS J. Comput. 3(1): 3-11 (1991) - [j17]Bennett L. Fox, David Goldsman, James J. Swain:
Spaced batch means. Oper. Res. Lett. 10(5): 255-263 (1991) - 1990
- [j16]Bennett L. Fox:
Generating Markov-Chain Transitions Quickly: I. INFORMS J. Comput. 2(2): 126-135 (1990) - [c4]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:
Alternative approaches for specifying input distributions and processes (panel session). WSC 1990: 382-386
1980 – 1989
- 1988
- [j15]Bennett L. Fox, Peter W. Glynn:
Computing Poisson Probabilities. Commun. ACM 31(4): 440-445 (1988) - [j14]Paul Bratley, Bennett L. Fox:
Algorithm 659: Implementing Sobol's quasirandom sequence generator. ACM Trans. Math. Softw. 14(1): 88-100 (1988) - 1987
- [b2]Paul Bratley, Bennett L. Fox, Linus Schrage:
A guide to simulation, 2nd Edition. Springer 1987, ISBN 978-3-540-96467-4, pp. I-XX, 1-397 - 1986
- [j13]Bennett L. Fox:
Algorithm 647: Implementation and Relative Efficiency of Quasirandom Sequence Generators. ACM Trans. Math. Softw. 12(4): 362-376 (1986) - 1983
- [b1]Paul Bratley, Bennett L. Fox, Linus E. Schrage:
A guide to simulation. Springer 1983, ISBN 354090820X, pp. I-XVIII, 1-383 - [c3]Bennett L. Fox:
Counterparts of variance reduction techniques for Quasi-Monte Carlo integration. WSC 1983: 621-622 - 1982
- [j12]Bennett L. Fox:
Coupled Successive Approximations for Markov Programs. Oper. Res. 30(2): 400-403 (1982) - [c2]Bruce W. Schmeiser, Bennett L. Fox, Peter A. W. Lewis, Andrew F. Seila, James R. Wilson:
Statistical issues in simulation research. WSC 1982: 705 - 1981
- [c1]Bennett L. Fox:
Fitting "standard" distributions to data is necessarily good: Dogma or myth? WSC 1981: 305-307 - 1980
- [j11]Eric V. Denardo, Bennett L. Fox:
Technical Note - Enforcing Constraints on Expanded Networks. Oper. Res. 28(5): 1213-1218 (1980)
1970 – 1979
- 1979
- [j10]Eric V. Denardo, Bennett L. Fox:
Shortest-Route Methods: 1. Reaching, Pruning, and Buckets. Oper. Res. 27(1): 161-186 (1979) - [j9]Eric V. Denardo, Bennett L. Fox:
Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound. Oper. Res. 27(3): 548-566 (1979) - 1978
- [j8]Bennett L. Fox:
Data Structures and Computer Science Techniques in Operations Research. Oper. Res. 26(5): 686-717 (1978) - 1975
- [j7]Bennett L. Fox:
More on kth Shortest Paths. Commun. ACM 18(5): 279 (1975) - 1973
- [j6]Bennett L. Fox:
Reducing the Number of Multiplikations in Iterative Processes. Acta Informatica 3: 43-45 (1973) - 1970
- [j5]Bennett L. Fox, D. M. Landi:
Searching for the Multiplier in One-Constraint Optimization Problems. Oper. Res. 18(2): 253-262 (1970) - [j4]Bennett L. Fox:
Accelerating List Processing in Discrete Programming. J. ACM 17(2): 383-384 (1970)
1960 – 1969
- 1969
- [j3]Bennett L. Fox:
Accelerating LP algorithms. Commun. ACM 12(7): 384-385 (1969) - 1968
- [j2]Bennett L. Fox, D. M. Landi:
Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix. Commun. ACM 11(9): 619-621 (1968) - 1967
- [j1]Eric V. Denardo, Bennett L. Fox:
Letter to the Editor - Nonoptimality of Planned Replacement in Intervals of Decreasing Failure Rate. Oper. Res. 15(2): 358-359 (1967)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
