| Publication | Date of Publication | Type |
|---|
Estimating Derivatives Via Poisson's Equation
Probability in the Engineering and Informational Sciences | 2007-01-19 | Paper |
Replication Schemes For Limiting Expectations
Probability in the Engineering and Informational Sciences | 2007-01-19 | Paper |
Filtering the Feynman--KAC Formula
SIAM Journal on Numerical Analysis | 2002-07-08 | Paper |
Separability in Optimal Allocation
Operations Research | 2002-06-04 | Paper |
Programs to generate Niederreiter's low-discrepancy sequences
ACM Transactions on Mathematical Software | 1998-01-25 | Paper |
Probabilistic search with overrides
The Annals of Applied Probability | 1996-07-08 | Paper |
| scientific article; zbMATH DE number 822313 (Why is no real title available?) | 1996-06-06 | Paper |
Implementation and tests of low-discrepancy sequences
ACM Transactions on Modeling and Computer Simulation | 1996-04-28 | Paper |
| scientific article; zbMATH DE number 822303 (Why is no real title available?) | 1996-02-18 | Paper |
Faster Simulated Annealing
SIAM Journal on Optimization | 1996-01-25 | Paper |
Shortening Future-Event Lists
ORSA Journal on Computing | 1993-09-16 | Paper |
Integrating and accelerating tabu search, simulated annealing, and genetic algorithms
Annals of Operations Research | 1993-08-16 | Paper |
Generating Markov-Chain Transitions Quickly: I
ORSA Journal on Computing | 1993-04-01 | Paper |
Generating Markov-Chain Transitions Quickly: II
ORSA Journal on Computing | 1993-02-18 | Paper |
Spaced batch means
Operations Research Letters | 1992-06-27 | Paper |
Discrete-Time Conversion for Simulating Finite-Horizon Markov Processes
SIAM Journal on Applied Mathematics | 1992-06-25 | Paper |
Simulating Discounted Costs
Management Science | 1989-01-01 | Paper |
Algorithm 659
ACM Transactions on Mathematical Software | 1988-01-01 | Paper |
Estimating Time Averages via Randomly-Spaced Observations
SIAM Journal on Applied Mathematics | 1987-01-01 | Paper |
Algorithm 647: Implementation and Relative Efficiency of Quasirandom Sequence Generators
ACM Transactions on Mathematical Software | 1986-01-01 | Paper |
Discrete-time conversion for simulating semi-Markov processes
Operations Research Letters | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3815002 (Why is no real title available?) | 1983-01-01 | Paper |
Coupled Successive Approximations for Markov Programs
Operations Research | 1982-01-01 | Paper |
Technical Note—Enforcing Constraints on Expanded Networks
Operations Research | 1980-01-01 | Paper |
Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
Operations Research | 1979-01-01 | Paper |
Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound
Operations Research | 1979-01-01 | Paper |
Construction of Voronoi polyhedra
Journal of Computational Physics | 1978-01-01 | Paper |
Branching from the largest upper bound. Folklore and facts
European Journal of Operational Research | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3718876 (Why is no real title available?) | 1978-01-01 | Paper |
Adaptive policies for Markov renewal programs
The Annals of Statistics | 1973-01-01 | Paper |
Searching for the Multiplier in One-Constraint Optimization Problems
Operations Research | 1970-01-01 | Paper |
Accelerating LP algorithms
Communications of the ACM | 1969-01-01 | Paper |
Multichain Markov Renewal Programs
SIAM Journal on Applied Mathematics | 1968-01-01 | Paper |
Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix
Communications of the ACM | 1968-01-01 | Paper |
Adaptive age replacement
Journal of Mathematical Analysis and Applications | 1967-01-01 | Paper |
Existence of Stationary Optimal Policies for Some Markov Renewal Programs
SIAM Review | 1967-01-01 | Paper |
Discrete Optimization Via Marginal Analysis
Management Science | 1966-01-01 | Paper |
Markov Renewal Programming by Linear Fractional Programming
SIAM Journal on Applied Mathematics | 1966-01-01 | Paper |
Letter to the Editor—Age Replacement with Discounting
Operations Research | 1966-01-01 | Paper |
