default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert L. Smith 0002
Person information
- affiliation: University of Michigan, Ann Arbor, Department of Industrial and Operations, MI, USA
Other persons with the same name
- Robert L. Smith — disambiguation page
- Robert L. Smith 0001 — Stanford University, CA, USA
- Robert L. Smith 0003 — Combined Arms Operations Research Activity, Fort Leavenworth, KS, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j74]Christopher Thomas Ryan, Robert L. Smith, Marina A. Epelman:
Minimum Spanning Trees in Infinite Graphs: Theory and Algorithms. SIAM J. Optim. 34(3): 3112-3135 (2024)- 2022
- [j73]Christopher Thomas Ryan, Robert L. Smith:
A greedy algorithm for finding maximum spanning trees in infinite graphs. Oper. Res. Lett. 50(6): 655-659 (2022) - 2021
- [j72]Christopher Thomas Ryan
, Robert L. Smith:
Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs. Math. Program. 187(1): 253-285 (2021) - [j71]Archis Ghate, Christopher Thomas Ryan, Robert L. Smith:
A Simplex Method for Countably Infinite Linear Programs. SIAM J. Optim. 31(4): 3157-3183 (2021) - 2020
- [j70]Seksan Kiatsupaibul, Robert L. Smith, Zelda B. Zabinsky:
Single observation adaptive search for discrete and continuous stochastic optimization. Oper. Res. Lett. 48(5): 666-673 (2020) - 2018
- [j69]Seksan Kiatsupaibul, Robert L. Smith, Zelda B. Zabinsky:
Single Observation Adaptive Search for Continuous Simulation Optimization. Oper. Res. 66(6): 1713-1727 (2018) - [j68]Christopher Thomas Ryan, Robert L. Smith, Marina A. Epelman:
A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems. SIAM J. Optim. 28(3): 2022-2048 (2018) - 2017
- [j67]Ilbin Lee, Marina A. Epelman, H. Edwin Romeijn, Robert L. Smith:
Simplex Algorithm for Countable-State Discounted Markov Decision Processes. Oper. Res. 65(4): 1029-1042 (2017) - 2016
- [j66]Seksan Kiatsupaibul, Robert L. Smith, Zelda B. Zabinsky:
Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem. J. Glob. Optim. 66(4): 711-727 (2016) - [j65]Irina S. Dolinskaya, Marina A. Epelman, Esra Sisikoglu, Robert L. Smith:
Parameter-Free Sampled Fictitious Play for Solving Deterministic Dynamic Programming Problems. J. Optim. Theory Appl. 169(2): 631-655 (2016) - 2015
- [j64]Timothy D. Lortz, Irina S. Dolinskaya, Archis Ghate, Robert L. Smith:
Solvability in infinite horizon optimization. Oper. Res. Lett. 43(5): 498-503 (2015) - 2014
- [j63]Ilbin Lee, Marina A. Epelman, H. Edwin Romeijn, Robert L. Smith:
Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space. Oper. Res. Lett. 42(3): 238-245 (2014) - 2013
- [j62]Archis Ghate, Robert L. Smith:
A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes. Oper. Res. 61(2): 413-425 (2013) - [j61]Irina S. Dolinskaya, Robert L. Smith:
Fastest-Path Planning for Direction-Dependent Speed Functions. J. Optim. Theory Appl. 158(2): 480-497 (2013) - 2011
- [j60]Marina A. Epelman, Archis Ghate, Robert L. Smith:
Sampled fictitious play for approximate dynamic programming. Comput. Oper. Res. 38(12): 1705-1718 (2011) - [j59]Huseyin Onur Mete, Yanfang Shen, Zelda B. Zabinsky, Seksan Kiatsupaibul, Robert L. Smith:
Pattern discrete and mixed Hit-and-Run for global optimization. J. Glob. Optim. 50(4): 597-627 (2011) - [j58]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) - [j57]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:1-16:11 (2011) - 2010
- [j56]Archis Ghate, Dushyant Sharma, Robert L. Smith:
A Shadow Simplex Method for Infinite Linear Programs. Oper. Res. 58(4-Part-1): 865-877 (2010) - 2009
- [j55]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. Oper. Res. 57(3): 727-739 (2009) - [j54]Archis Ghate, Robert L. Smith:
Optimal Backlogging Over an Infinite Horizon Under Time-Varying Convex Production and Inventory Costs. Manuf. Serv. Oper. Manag. 11(2): 362-368 (2009) - [j53]Archis Ghate, Robert L. Smith:
A Hit-and-Run approach for generating scale invariant Small World networks. Networks 53(1): 67-78 (2009) - [j52]Archis Ghate, Robert L. Smith:
Characterizing extreme points as basic feasible solutions in infinite linear programs. Oper. Res. Lett. 37(1): 7-10 (2009) - 2008
- [j51]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) - [j50]Archis Ghate, Robert L. Smith:
Adaptive search with stochastic acceptance probabilities for global optimization. Oper. Res. Lett. 36(3): 285-290 (2008) - [j49]Archis Ghate, Robert L. Smith:
A dynamic programming approach to efficient sampling from Boltzmann distributions. Oper. Res. Lett. 36(6): 665-668 (2008) - 2007
- [j48]Yanfang Shen, Seksan Kiatsupaibul, Zelda B. Zabinsky, Robert L. Smith:
An analytically derived cooling schedule for simulated annealing. J. Glob. Optim. 38(3): 333-365 (2007) - [j47]Torpong Cheevaprawatdomrong, Irwin E. Schochetman, Robert L. Smith, Alfredo García:
Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes. Math. Oper. Res. 32(1): 51-72 (2007) - [j46]Irwin E. Schochetman, Robert L. Smith:
Infinite horizon optimality criteria for equipment replacement under technological change. Oper. Res. Lett. 35(4): 485-492 (2007) - 2006
- [j45]H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith:
Extreme point characterizations for infinite network flow problems. Networks 48(4): 209-222 (2006) - [j44]Shih-Fen Cheng, Marina A. Epelman, Robert L. Smith:
CoSIGN: A Parallel Algorithm for Coordinated Traffic Signal Control. IEEE Trans. Intell. Transp. Syst. 7(4): 551-564 (2006) - 2005
- [j43]Irwin E. Schochetman, Robert L. Smith:
Optimality criteria for deterministic discrete-time infinite horizon optimization. Int. J. Math. Math. Sci. 2005(1): 57-80 (2005) - [j42]Theodore J. Lambert III, Marina A. Epelman, Robert L. Smith:
A Fictitious Play Approach to Large-Scale Optimization. Oper. Res. 53(3): 477-489 (2005) - [j41]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) - 2004
- [j40]Torpong Cheevaprawatdomrong, Robert L. Smith:
Infinite Horizon Production Scheduling in Time - Varying Systems Under Stochastic Demand. Oper. Res. 52(1): 105-115 (2004) - 2003
- [j39]Zelda B. Zabinsky, Robert L. Smith, Birna P. Kristinsdottir:
Optimal estimation of univariate black-box Lipschitz functions with upper and lower error bounds. Comput. Oper. Res. 30(10): 1539-1553 (2003) - [j38]Torpong Cheevaprawatdomrong, Robert L. Smith:
A paradox in equipment replacement under technological improvement. Oper. Res. Lett. 31(1): 77-82 (2003) - 2001
- [j37]Irwin E. Schochetman, Robert L. Smith:
A Finite Algorithm for Solving Infinite Dimensional Optimization Problems. Ann. Oper. Res. 101(1-4): 119-142 (2001) - [j36]Daniel J. Reaume, H. Edwin Romeijn, Robert L. Smith:
Implementing pure adaptive search for global optimization using Markov chain sampling. J. Glob. Optim. 20(1): 33-47 (2001) - 2000
- [j35]Alfredo García, Robert L. Smith:
Solving nonstationary infinite horizon stochastic production planning problems. Oper. Res. Lett. 27(3): 135-141 (2000) - [j34]Karl E. Wunderlich, David E. Kaufman, Robert L. Smith:
Link travel time prediction for decentralized route guidance architectures. IEEE Trans. Intell. Transp. Syst. 1(1): 4-14 (2000) - 1999
- [j33]H. Edwin Romeijn, Robert L. Smith:
Parallel algorithms for solving aggregated shortest-path problems. Comput. Oper. Res. 26(10-11): 941-953 (1999) - 1998
- [j32]Yu-Li Chou, H. Edwin Romeijn, Robert L. Smith:
Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems. INFORMS J. Comput. 10(2): 163-179 (1998) - [j31]David E. Kaufman, Robert L. Smith:
Direction Choice for Accelerated Convergence in Hit-and-Run Sampling. Oper. Res. 46(1): 84-95 (1998) - [j30]H. Edwin Romeijn, Robert L. Smith:
Shadow Prices in Infinite-Dimensional Linear Programming. Math. Oper. Res. 23(1): 239-256 (1998) - [j29]Irwin E. Schochetman, Robert L. Smith:
Existence and Discovery of Average Optimal Solutions in Deterministic Infinite Horizon Optimization. Math. Oper. Res. 23(2): 416-432 (1998) - [j28]William P. Cross, H. Edwin Romeijn, Robert L. Smith:
Approximating Extreme Points of Infinite Dimensional Convex Sets. Math. Oper. Res. 23(2): 433-442 (1998) - 1994
- [j27]H. Edwin Romeijn, Robert L. Smith:
Simulated annealing for constrained global optimization. J. Glob. Optim. 5(2): 101-126 (1994) - [j26]Irwin E. Schochetman, Robert L. Smith:
Solution approximation in infinite horizon linear quadratic control. IEEE Trans. Autom. Control. 39(3): 596-601 (1994) - 1993
- [j25]Zelda B. Zabinsky, Robert L. Smith, J. Fred McDonald, H. Edwin Romeijn, David E. Kaufman:
Improving Hit-and-Run for global optimization. J. Glob. Optim. 3(2): 171-192 (1993) - [j24]David E. Kaufman, Robert L. Smith:
Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application. J. Intell. Transp. Syst. 1(1): 1-11 (1993) - [j23]Claude J. P. Bélisle, H. Edwin Romeijn, Robert L. Smith:
Hit-and-Run Algorithms for Generating Multivariate Distributions. Math. Oper. Res. 18(2): 255-266 (1993) - [j22]James C. Bean, Robert L. Smith:
Conditions for the discovery of solution horizons. Math. Program. 59: 215-229 (1993) - 1992
- [j21]Sarah M. Ryan, James C. Bean, Robert L. Smith:
A Tie-Breaking Rule for Discrete Infinite Horizon Optimization. Oper. Res. 40(Supplement-1): S117-S126 (1992) - [j20]Jeffrey M. Alden, Robert L. Smith:
Rolling Horizon Procedures in Nonhomogeneous Markov Decision Processes. Oper. Res. 40(Supplement-2): S183-S194 (1992) - [j19]James C. Bean, Julia L. Higle, Robert L. Smith:
Capacity Expansion Under Stochastic Demands. Oper. Res. 40(Supplement-2): S210-S216 (1992) - [j18]H. Edwin Romeijn, Robert L. Smith, James C. Bean:
Duality in infinite dimensional linear programming. Math. Program. 53: 79-97 (1992) - [j17]Zelda B. Zabinsky, Robert L. Smith:
Pure adaptive search in global optimization. Math. Program. 53: 323-338 (1992) - [j16]Irwin E. Schochetman, Robert L. Smith:
Finite dimensional approximation in infinite dimensional mathematical programming. Math. Program. 54: 307-333 (1992) - 1991
- [j15]C. G. E. Boender, Richard J. Caron, J. Fred McDonald, A. H. G. Rinnooy Kan, H. Edwin Romeijn, Robert L. Smith, Jan Telgen, A. C. F. Vorst:
Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra. Oper. Res. 39(6): 945-954 (1991) - 1990
- [j14]Julia L. Higle, James C. Bean, Robert L. Smith:
Deterministic Equivalence in Stochastic Infinite Horizon Problems. Math. Oper. Res. 15(3): 396-407 (1990) - 1989
- [j13]Irwin E. Schochetman, Robert L. Smith:
Infinite Horizon Optimization. Math. Oper. Res. 14(3): 559-574 (1989) - [j12]Nitin R. Patel, Robert L. Smith, Zelda B. Zabinsky:
Pure adaptive search in monte carlo optimization. Math. Program. 43(1-3): 317-328 (1989) - 1987
- [j11]James C. Bean, John R. Birge, Robert L. Smith:
Aggregation in Dynamic Programming. Oper. Res. 35(2): 215-220 (1987) - [j10]Wallace J. Hopp, James C. Bean, Robert L. Smith:
A New Optimality Criterion for Nonhomogeneous Markov Decision Processes. Oper. Res. 35(6): 875-883 (1987) - [j9]H. C. P. Berbee, C. G. E. Boender, A. H. G. Rinnooy Kan, C. L. Scheffer, Robert L. Smith, Jan Telgen:
Hit-and-run algorithms for the identification of nonredundant linear inequalities. Math. Program. 37(2): 184-207 (1987) - 1986
- [j8]Sancho E. Berenguer, Robert L. Smith:
The expected number of extreme points of a random linear program. Math. Program. 35(2): 129-134 (1986) - 1985
- [j7]Allan R. Sampson, Robert L. Smith:
An information theory model for the evaluation of circumstantial evidence. IEEE Trans. Syst. Man Cybern. 15(1): 9-16 (1985) - 1984
- [j6]Robert L. Smith:
Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions. Oper. Res. 32(6): 1296-1308 (1984) - [j5]James C. Bean, Robert L. Smith:
Conditions for the Existence of Planning Horizons. Math. Oper. Res. 9(3): 391-401 (1984) - 1983
- [j4]Nitin R. Patel, Robert L. Smith:
Technical Note - The Asymptotic Extreme Value Distribution of the Sample Minimum of a Concave Function under Linear Constraints. Oper. Res. 31(4): 789-794 (1983) - 1982
- [j3]Allan R. Sampson, Robert L. Smith:
Assessing Risks Through the Determination of Rare Event Probabilities. Oper. Res. 30(5): 839-866 (1982) - [j2]Jerrold H. May, Robert L. Smith:
Random polytopes: Their definition, generation and aggregate properties. Math. Program. 24(1): 39-54 (1982) - 1981
- [j1]Robert L. Smith:
Planning horizons for the deterministic capacity problem. Comput. Oper. Res. 8(3): 209-220 (1981)
Conference and Workshop Papers
- 2017
- [c4]David D. Linz, Zelda B. Zabinsky, Seksan Kiatsupaibul, Robert L. Smith:
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. WSC 2017: 2045-2056 - 2015
- [c3]Seksan Kiatsupaibul, Robert L. Smith, Zelda B. Zabinsky:
Improving hit-and-run with single observations for continuous simulation optimization. WSC 2015: 3569-3576 - 2011
- [c2]Esra Sisikoglu, Marina A. Epelman, Robert L. Smith:
A sampled fictitious play based learning algorithm for infinite horizon Markov decision processes. WSC 2011: 4091-4102 - 1996
- [c1]Robert L. Smith:
The Hit-and-Run Sampler: A Globally Reaching Markov Chain Sampler for Generating Arbitrary Multivariate Distributions. WSC 1996: 260-264
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-09-21 02:34 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:
