| Publication | Date of Publication | Type |
|---|
| Replication Schemes For Limiting Expectations | 2007-01-19 | Paper |
| Estimating Derivatives Via Poisson's Equation | 2007-01-19 | Paper |
| Filtering the Feynman--KAC Formula | 2002-07-08 | Paper |
| Separability in Optimal Allocation | 2002-06-04 | Paper |
| Programs to generate Niederreiter's low-discrepancy sequences | 1998-01-25 | Paper |
| Probabilistic search with overrides | 1996-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4856462 | 1996-06-06 | Paper |
| Implementation and tests of low-discrepancy sequences | 1996-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4856452 | 1996-02-18 | Paper |
| Faster Simulated Annealing | 1996-01-25 | Paper |
| Shortening Future-Event Lists | 1993-09-16 | Paper |
| Integrating and accelerating tabu search, simulated annealing, and genetic algorithms | 1993-08-16 | Paper |
| Generating Markov-Chain Transitions Quickly: I | 1993-04-01 | Paper |
| Generating Markov-Chain Transitions Quickly: II | 1993-02-18 | Paper |
| Spaced batch means | 1992-06-27 | Paper |
| Discrete-Time Conversion for Simulating Finite-Horizon Markov Processes | 1992-06-25 | Paper |
| Simulating Discounted Costs | 1989-01-01 | Paper |
| Algorithm 659 | 1988-01-01 | Paper |
| Estimating Time Averages via Randomly-Spaced Observations | 1987-01-01 | Paper |
| Discrete-time conversion for simulating semi-Markov processes | 1986-01-01 | Paper |
| Algorithm 647: Implementation and Relative Efficiency of Quasirandom Sequence Generators | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3662646 | 1983-01-01 | Paper |
| Coupled Successive Approximations for Markov Programs | 1982-01-01 | Paper |
| Technical Note—Enforcing Constraints on Expanded Networks | 1980-01-01 | Paper |
| Shortest-Route Methods: 1. Reaching, Pruning, and Buckets | 1979-01-01 | Paper |
| Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound | 1979-01-01 | Paper |
| Branching from the largest upper bound. Folklore and facts | 1978-01-01 | Paper |
| Construction of Voronoi polyhedra | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3908785 | 1978-01-01 | Paper |
| Adaptive policies for Markov renewal programs | 1973-01-01 | Paper |
| Searching for the Multiplier in One-Constraint Optimization Problems | 1970-01-01 | Paper |
| Accelerating LP algorithms | 1969-01-01 | Paper |
| Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix | 1968-01-01 | Paper |
| Multichain Markov Renewal Programs | 1968-01-01 | Paper |
| Adaptive age replacement | 1967-01-01 | Paper |
| Existence of Stationary Optimal Policies for Some Markov Renewal Programs | 1967-01-01 | Paper |
| Letter to the Editor—Age Replacement with Discounting | 1966-01-01 | Paper |
| Markov Renewal Programming by Linear Fractional Programming | 1966-01-01 | Paper |
| Discrete Optimization Via Marginal Analysis | 1966-01-01 | Paper |
