2009 |
23 | EE | Archis Ghate,
Robert L. Smith:
A Hit-and-Run approach for generating scale invariant Small World networks.
Networks 53(1): 67-78 (2009) |
22 | EE | 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 |
21 | EE | 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) |
20 | EE | Archis Ghate,
Robert L. Smith:
Adaptive search with stochastic acceptance probabilities for global optimization.
Oper. Res. Lett. 36(3): 285-290 (2008) |
19 | EE | Archis Ghate,
Robert L. Smith:
A dynamic programming approach to efficient sampling from Boltzmann distributions.
Oper. Res. Lett. 36(6): 665-668 (2008) |
2007 |
18 | EE | 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 |
17 | EE | 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) |
16 | EE | H. Edwin Romeijn,
Dushyant Sharma,
Robert L. Smith:
Extreme point characterizations for infinite network flow problems.
Networks 48(4): 209-222 (2006) |
2005 |
15 | EE | 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) |
2003 |
14 | EE | 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) |
13 | EE | Torpong Cheevaprawatdomrong,
Robert L. Smith:
A paradox in equipment replacement under technological improvement.
Oper. Res. Lett. 31(1): 77-82 (2003) |
2001 |
12 | EE | Irwin E. Schochetman,
Robert L. Smith:
A Finite Algorithm for Solving Infinite Dimensional Optimization Problems.
Annals OR 101(1-4): 119-142 (2001) |
2000 |
11 | EE | 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) |
10 | EE | Alfredo Garcia,
Robert L. Smith:
Solving nonstationary infinite horizon stochastic production planning problems.
Oper. Res. Lett. 27(3): 135-141 (2000) |
1999 |
9 | EE | H. Edwin Romeijn,
Robert L. Smith:
Parallel algorithms for solving aggregated shortest-path problems.
Computers & OR 26(10-11): 941-953 (1999) |
1996 |
8 | EE | 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 |
1993 |
7 | | James C. Bean,
Robert L. Smith:
Conditions for the discovery of solution horizons.
Math. Program. 59: 215-229 (1993) |
1992 |
6 | | Zelda B. Zabinsky,
Robert L. Smith:
Pure adaptive search in global optimization.
Math. Program. 53: 323-338 (1992) |
5 | | H. Edwin Romeijn,
Robert L. Smith,
James C. Bean:
Duality in infinite dimensional linear programming.
Math. Program. 53: 79-97 (1992) |
4 | | Irwin E. Schochetman,
Robert L. Smith:
Finite dimensional approximation in infinite dimensional mathematical programming.
Math. Program. 54: 307-333 (1992) |
1988 |
3 | | Robert L. Smith:
CD-Rom for National Bibliographies: A European Project.
Essen Symposium 1988: 221-230 |
1981 |
2 | EE | Robert L. Smith:
Planning horizons for the deterministic capacity problem.
Computers & OR 8(3): 209-220 (1981) |
1962 |
1 | EE | Robert L. Smith:
Algorithm 116: Complex division.
Commun. ACM 5(8): 435 (1962) |