Planning horizons for the deterministic capacity problem. - Robert L. Smith 002 (Comput. Oper. Res., 1981)

Assessing Risks Through the Determination of Rare Event Probabilities. - Allan R. Sampson; Robert L. Smith 002 (Oper. Res., 1982)

Random polytopes: Their definition, generation and aggregate properties. - Jerrold H. May; Robert L. Smith 002 (Math. Program., 1982)

Technical Note - The Asymptotic Extreme Value Distribution of the Sample Minimum of a Concave Function under Linear Constraints. - Nitin R. Patel; Robert L. Smith 002 (Oper. Res., 1983)

Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions. - Robert L. Smith 002 (Oper. Res., 1984)

Conditions for the Existence of Planning Horizons. - James C. Bean; Robert L. Smith 002 (Math. Oper. Res., 1984)

An information theory model for the evaluation of circumstantial evidence. - Allan R. Sampson; Robert L. Smith 002 (IEEE Trans. Syst. Man Cybern., 1985)

The expected number of extreme points of a random linear program. - Sancho E. Berenguer; Robert L. Smith 002 (Math. Program., 1986)

Aggregation in Dynamic Programming. - James C. Bean; John R. Birge; Robert L. Smith 002 (Oper. Res., 1987)

A New Optimality Criterion for Nonhomogeneous Markov Decision Processes. - Wallace J. Hopp; James C. Bean; Robert L. Smith 002 (Oper. Res., 1987)

Hit-and-run algorithms for the identification of nonredundant linear inequalities. - H. C. P. Berbee; C. G. E. Boender; A. H. G. Rinnooy Kan; C. L. Scheffer; Robert L. Smith 002; Jan Telgen (Math. Program., 1987)

Infinite Horizon Optimization. - Irwin E. Schochetman; Robert L. Smith 002 (Math. Oper. Res., 1989)

Pure adaptive search in monte carlo optimization. - Nitin R. Patel; Robert L. Smith 002; Zelda B. Zabinsky (Math. Program., 1989)

Deterministic Equivalence in Stochastic Infinite Horizon Problems. - Julia L. Higle; James C. Bean; Robert L. Smith 002 (Math. Oper. Res., 1990)

Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra. - C. G. E. Boender; Richard J. Caron; J. Fred McDonald; A. H. G. Rinnooy Kan; H. Edwin Romeijn; Robert L. Smith 002; Jan Telgen; A. C. F. Vorst (Oper. Res., 1991)

Rolling Horizon Procedures in Nonhomogeneous Markov Decision Processes. - Jeffrey M. Alden; Robert L. Smith 002 (Oper. Res., 1992)

Capacity Expansion Under Stochastic Demands. - James C. Bean; Julia L. Higle; Robert L. Smith 002 (Oper. Res., 1992)

A Tie-Breaking Rule for Discrete Infinite Horizon Optimization. - Sarah M. Ryan; James C. Bean; Robert L. Smith 002 (Oper. Res., 1992)

Duality in infinite dimensional linear programming. - H. Edwin Romeijn; Robert L. Smith 002; James C. Bean (Math. Program., 1992)

Finite dimensional approximation in infinite dimensional mathematical programming. - Irwin E. Schochetman; Robert L. Smith 002 (Math. Program., 1992)

Pure adaptive search in global optimization. - Zelda B. Zabinsky; Robert L. Smith 002 (Math. Program., 1992)

Improving Hit-and-Run for global optimization. - Zelda B. Zabinsky; Robert L. Smith 002; J. Fred McDonald; H. Edwin Romeijn; David E. Kaufman (J. Glob. Optim., 1993)

Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application. - David E. Kaufman; Robert L. Smith 002 (J. Intell. Transp. Syst., 1993)

Hit-and-Run Algorithms for Generating Multivariate Distributions. - Claude J. P. Bélisle; H. Edwin Romeijn; Robert L. Smith 002 (Math. Oper. Res., 1993)

Conditions for the discovery of solution horizons. - James C. Bean; Robert L. Smith 002 (Math. Program., 1993)

Simulated annealing for constrained global optimization. - H. Edwin Romeijn; Robert L. Smith 002 (J. Glob. Optim., 1994)

Solution approximation in infinite horizon linear quadratic control. - Irwin E. Schochetman; Robert L. Smith 002 (IEEE Trans. Autom. Control., 1994)

The Hit-and-Run Sampler: A Globally Reaching Markov Chain Sampler for Generating Arbitrary Multivariate Distributions. - Robert L. Smith 002 (WSC, 1996)

Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems. - Yu-Li Chou; H. Edwin Romeijn; Robert L. Smith 002 (INFORMS J. Comput., 1998)

Direction Choice for Accelerated Convergence in Hit-and-Run Sampling. - David E. Kaufman; Robert L. Smith 002 (Oper. Res., 1998)

Approximating Extreme Points of Infinite Dimensional Convex Sets. - William P. Cross; H. Edwin Romeijn; Robert L. Smith 002 (Math. Oper. Res., 1998)

Shadow Prices in Infinite-Dimensional Linear Programming. - H. Edwin Romeijn; Robert L. Smith 002 (Math. Oper. Res., 1998)

Existence and Discovery of Average Optimal Solutions in Deterministic Infinite Horizon Optimization. - Irwin E. Schochetman; Robert L. Smith 002 (Math. Oper. Res., 1998)

Parallel algorithms for solving aggregated shortest-path problems. - H. Edwin Romeijn; Robert L. Smith 002 (Comput. Oper. Res., 1999)

Solving nonstationary infinite horizon stochastic production planning problems. - Alfredo García 001; Robert L. Smith 002 (Oper. Res. Lett., 2000)

Link travel time prediction for decentralized route guidance architectures. - Karl E. Wunderlich; David E. Kaufman; Robert L. Smith 002 (IEEE Trans. Intell. Transp. Syst., 2000)

A Finite Algorithm for Solving Infinite Dimensional Optimization Problems. - Irwin E. Schochetman; Robert L. Smith 002 (Ann. Oper. Res., 2001)

Implementing pure adaptive search for global optimization using Markov chain sampling. - Daniel J. Reaume; H. Edwin Romeijn; Robert L. Smith 002 (J. Glob. Optim., 2001)

Optimal estimation of univariate black-box Lipschitz functions with upper and lower error bounds. - Zelda B. Zabinsky; Robert L. Smith 002; Birna P. Kristinsdottir (Comput. Oper. Res., 2003)

A paradox in equipment replacement under technological improvement. - Torpong Cheevaprawatdomrong; Robert L. Smith 002 (Oper. Res. Lett., 2003)

Infinite Horizon Production Scheduling in Time - Varying Systems Under Stochastic Demand. - Torpong Cheevaprawatdomrong; Robert L. Smith 002 (Oper. Res., 2004)

Optimality criteria for deterministic discrete-time infinite horizon optimization. - Irwin E. Schochetman; Robert L. Smith 002 (Int. J. Math. Math. Sci., 2005)

A Fictitious Play Approach to Large-Scale Optimization. - Theodore J. Lambert III; Marina A. Epelman; Robert L. Smith 002 (Oper. Res., 2005)

Existence of efficient solutions in infinite horizon optimization under continuous and discrete controls. - Irwin E. Schochetman; Robert L. Smith 002 (Oper. Res. Lett., 2005)

Extreme point characterizations for infinite network flow problems. - H. Edwin Romeijn; Dushyant Sharma; Robert L. Smith 002 (Networks, 2006)

CoSIGN: A Parallel Algorithm for Coordinated Traffic Signal Control. - Shih-Fen Cheng; Marina A. Epelman; Robert L. Smith 002 (IEEE Trans. Intell. Transp. Syst., 2006)

An analytically derived cooling schedule for simulated annealing. - Yanfang Shen; Seksan Kiatsupaibul; Zelda B. Zabinsky; Robert L. Smith 002 (J. Glob. Optim., 2007)

Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes. - Torpong Cheevaprawatdomrong; Irwin E. Schochetman; Robert L. Smith 002; Alfredo García 001 (Math. Oper. Res., 2007)

Infinite horizon optimality criteria for equipment replacement under technological change. - Irwin E. Schochetman; Robert L. Smith 002 (Oper. Res. Lett., 2007)

A Reach and Bound algorithm for acyclic dynamic-programming networks. - Matthew D. Bailey; Robert L. Smith 002; Jeffrey M. Alden (Networks, 2008)

Adaptive search with stochastic acceptance probabilities for global optimization. - Archis Ghate; Robert L. Smith 002 (Oper. Res. Lett., 2008)

A dynamic programming approach to efficient sampling from Boltzmann distributions. - Archis Ghate; Robert L. Smith 002 (Oper. Res. Lett., 2008)

Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles. - Stephen Baumert; Archis Ghate; Seksan Kiatsupaibul; Yanfang Shen; Robert L. Smith 002; Zelda B. Zabinsky (Oper. Res., 2009)

Optimal Backlogging Over an Infinite Horizon Under Time-Varying Convex Production and Inventory Costs. - Archis Ghate; Robert L. Smith 002 (Manuf. Serv. Oper. Manag., 2009)

A Hit-and-Run approach for generating scale invariant Small World networks. - Archis Ghate; Robert L. Smith 002 (Networks, 2009)

Characterizing extreme points as basic feasible solutions in infinite linear programs. - Archis Ghate; Robert L. Smith 002 (Oper. Res. Lett., 2009)

A Shadow Simplex Method for Infinite Linear Programs. - Archis Ghate; Dushyant Sharma; Robert L. Smith 002 (Oper. Res., 2010)

A sampled fictitious play based learning algorithm for infinite horizon Markov decision processes. - Esra Sisikoglu; Marina A. Epelman; Robert L. Smith 002 (WSC, 2011)

Sampled fictitious play for approximate dynamic programming. - Marina A. Epelman; Archis Ghate; Robert L. Smith 002 (Comput. Oper. Res., 2011)

Pattern discrete and mixed Hit-and-Run for global optimization. - Huseyin Onur Mete; Yanfang Shen; Zelda B. Zabinsky; Seksan Kiatsupaibul; Robert L. Smith 002 (J. Glob. Optim., 2011)

Average Optimality in Nonhomogeneous Infinite Horizon Markov Decision Processes. - Allise O. Wachs; Irwin E. Schochetman; Robert L. Smith 002 (Math. Oper. Res., 2011)

An analysis of a variation of hit-and-run for uniform sampling from general regions. - Seksan Kiatsupaibul; Robert L. Smith 002; Zelda B. Zabinsky (ACM Trans. Model. Comput. Simul., 2011)

A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes. - Archis Ghate; Robert L. Smith 002 (Oper. Res., 2013)

Fastest-Path Planning for Direction-Dependent Speed Functions. - Irina S. Dolinskaya; Robert L. Smith 002 (J. Optim. Theory Appl., 2013)

Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space. - Ilbin Lee; Marina A. Epelman; H. Edwin Romeijn; Robert L. Smith 002 (Oper. Res. Lett., 2014)

Improving hit-and-run with single observations for continuous simulation optimization. - Seksan Kiatsupaibul; Robert L. Smith 002; Zelda B. Zabinsky (WSC, 2015)

Solvability in infinite horizon optimization. - Timothy D. Lortz; Irina S. Dolinskaya; Archis Ghate; Robert L. Smith 002 (Oper. Res. Lett., 2015)

Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem. - Seksan Kiatsupaibul; Robert L. Smith 002; Zelda B. Zabinsky (J. Glob. Optim., 2016)

Parameter-Free Sampled Fictitious Play for Solving Deterministic Dynamic Programming Problems. - Irina S. Dolinskaya; Marina A. Epelman; Esra Sisikoglu; Robert L. Smith 002 (J. Optim. Theory Appl., 2016)

A computational comparison of simulation optimization methods using single observations within a shrinking ball on noisy black-box functions with mixed integer and continuous domains. - David D. Linz; Zelda B. Zabinsky; Seksan Kiatsupaibul; Robert L. Smith 002 (WSC, 2017)

Simplex Algorithm for Countable-State Discounted Markov Decision Processes. - Ilbin Lee; Marina A. Epelman; H. Edwin Romeijn; Robert L. Smith 002 (Oper. Res., 2017)

Single Observation Adaptive Search for Continuous Simulation Optimization. - Seksan Kiatsupaibul; Robert L. Smith 002; Zelda B. Zabinsky (Oper. Res., 2018)

A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems. - Christopher Thomas Ryan; Robert L. Smith 002; Marina A. Epelman (SIAM J. Optim., 2018)

Single observation adaptive search for discrete and continuous stochastic optimization. - Seksan Kiatsupaibul; Robert L. Smith 002; Zelda B. Zabinsky (Oper. Res. Lett., 2020)

Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs. - Christopher Thomas Ryan; Robert L. Smith 002 (Math. Program., 2021)

A Simplex Method for Countably Infinite Linear Programs. - Archis Ghate; Christopher Thomas Ryan; Robert L. Smith 002 (SIAM J. Optim., 2021)

A greedy algorithm for finding maximum spanning trees in infinite graphs. - Christopher Thomas Ryan; Robert L. Smith 002 (Oper. Res. Lett., 2022)

Monte Carlo Fictitious Play for Finding Pure Nash Equilibria in Identical Interest Games. - Seksan Kiatsupaibul; Giulia Pedrielli; Christopher Thomas Ryan; Robert L. Smith 002; Zelda B. Zabinsky (INFORMS J. Optim., 2024)

Minimum Spanning Trees in Infinite Graphs: Theory and Algorithms. - Christopher Thomas Ryan; Robert L. Smith 002; Marina A. Epelman (SIAM J. Optim., 2024)