Robert L. Smith

Archis Ghate, Robert L. Smith: A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes. Operations Research 61(2): 413-425 (2013)

Michael Baudin, Robert L. Smith: A Robust Complex Division in Scilab. CoRR abs/1210.4539 (2012)

Marina A. Epelman, Archis Ghate, Robert L. Smith: Sampled fictitious play for approximate dynamic programming. Computers & OR 38(12): 1705-1718 (2011)

Huseyin Onur Mete, Yanfang Shen, Zelda B. Zabinsky, Seksan Kiatsupaibul, Robert L. Smith: Pattern discrete and mixed Hit-and-Run for global optimization. J. Global Optimization 50(4): 597-627 (2011)

Allise O. Wachs, Irwin E. Schochetman, Robert L. Smith: Average Optimality in Nonhomogeneous Infinite Horizon Markov Decision Processes. Math. Oper. Res. 36(1): 147-164 (2011)

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

Esra Sisikoglu, Marina A. Epelman, Robert L. Smith: A sampled fictitious play based learning algorithm for infinite horizon Markov decision processes. Winter Simulation Conference 2011: 4091-4102

Archis Ghate, Dushyant Sharma, Robert L. Smith: A Shadow Simplex Method for Infinite Linear Programs. Operations Research 58(4-Part-1): 865-877 (2010)

Stephen Baumert, Archis Ghate, Seksan Kiatsupaibul, Yanfang Shen, Robert L. Smith, Zelda B. Zabinsky: Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles. Operations Research 57(3): 727-739 (2009)

Archis Ghate, Robert L. Smith: Optimal Backlogging Over an Infinite Horizon Under Time-Varying Convex Production and Inventory Costs. Manufacturing & Service Operations Management 11(2): 362-368 (2009)

Archis Ghate, Robert L. Smith: A Hit-and-Run approach for generating scale invariant Small World networks. Networks 53(1): 67-78 (2009)

Archis Ghate, Robert L. Smith: Characterizing extreme points as basic feasible solutions in infinite linear programs. Oper. Res. Lett. 37(1): 7-10 (2009)

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

Archis Ghate, Robert L. Smith: Adaptive search with stochastic acceptance probabilities for global optimization. Oper. Res. Lett. 36(3): 285-290 (2008)

Archis Ghate, Robert L. Smith: A dynamic programming approach to efficient sampling from Boltzmann distributions. Oper. Res. Lett. 36(6): 665-668 (2008)

Yanfang Shen, Seksan Kiatsupaibul, Zelda B. Zabinsky, Robert L. Smith: An analytically derived cooling schedule for simulated annealing. J. Global Optimization 38(3): 333-365 (2007)

Torpong Cheevaprawatdomrong, Irwin E. Schochetman, Robert L. Smith, Alfredo Garcia: Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes. Math. Oper. Res. 32(1): 51-72 (2007)

Irwin E. Schochetman, Robert L. Smith: Infinite horizon optimality criteria for equipment replacement under technological change. Oper. Res. Lett. 35(4): 485-492 (2007)

H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith: Extreme point characterizations for infinite network flow problems. Networks 48(4): 209-222 (2006)

Shih-Fen Cheng, Marina A. Epelman, Robert L. Smith: CoSIGN: A Parallel Algorithm for Coordinated Traffic Signal Control. IEEE Transactions on Intelligent Transportation Systems 7(4): 551-564 (2006)

Irwin E. Schochetman, Robert L. Smith: Optimality criteria for deterministic discrete-time infinite horizon optimization. Int. J. Math. Mathematical Sciences 2005(1): 57-80 (2005)

Theodore J. Lambert III, Marina A. Epelman, Robert L. Smith: A Fictitious Play Approach to Large-Scale Optimization. Operations Research 53(3): 477-489 (2005)

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

Torpong Cheevaprawatdomrong, Robert L. Smith: Infinite Horizon Production Scheduling in Time - Varying Systems Under Stochastic Demand. Operations Research 52(1): 105-115 (2004)

Zelda B. Zabinsky, Robert L. Smith, Birna P. Kristinsdottir: Optimal estimation of univariate black-box Lipschitz functions with upper and lower error bounds. Computers & OR 30(10): 1539-1553 (2003)

Torpong Cheevaprawatdomrong, Robert L. Smith: A paradox in equipment replacement under technological improvement. Oper. Res. Lett. 31(1): 77-82 (2003)

Irwin E. Schochetman, Robert L. Smith: A Finite Algorithm for Solving Infinite Dimensional Optimization Problems. Annals OR 101(1-4): 119-142 (2001)

Alfredo Garcia, Robert L. Smith: Solving nonstationary infinite horizon stochastic production planning problems. Oper. Res. Lett. 27(3): 135-141 (2000)

Karl E. Wunderlich, David E. Kaufman, Robert L. Smith: Link travel time prediction for decentralized route guidance architectures. IEEE Transactions on Intelligent Transportation Systems 1(1): 4-14 (2000)

H. Edwin Romeijn, Robert L. Smith: Parallel algorithms for solving aggregated shortest-path problems. Computers & OR 26(10-11): 941-953 (1999)

Yu-Li Chou, H. Edwin Romeijn, Robert L. Smith: Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems. INFORMS Journal on Computing 10(2): 163-179 (1998)

Robert L. Smith: The Hit-and-Run Sampler: A Globally Reaching Markov Chain Sampler for Generating Arbitrary Multivariate Distributions. Winter Simulation Conference 1996: 260-264

James C. Bean, Robert L. Smith: Conditions for the discovery of solution horizons. Math. Program. 59: 215-229 (1993)

H. Edwin Romeijn, Robert L. Smith, James C. Bean: Duality in infinite dimensional linear programming. Math. Program. 53: 79-97 (1992)

Zelda B. Zabinsky, Robert L. Smith: Pure adaptive search in global optimization. Math. Program. 53: 323-338 (1992)

Irwin E. Schochetman, Robert L. Smith: Finite dimensional approximation in infinite dimensional mathematical programming. Math. Program. 54: 307-333 (1992)

Robert L. Smith: CD-Rom for National Bibliographies: A European Project. Essen Symposium 1988: 221-230

Robert L. Smith: Planning horizons for the deterministic capacity problem. Computers & OR 8(3): 209-220 (1981)

Robert L. Smith: Algorithm 116: Complex division. Commun. ACM 5(8): 435 (1962)