| Simplex Algorithm for Countable-State Discounted Markov Decision Processes | 3 | 0.43 | 2017 |
| Parameter-Free Sampled Fictitious Play for Solving Deterministic Dynamic Programming Problems | 0 | 0.34 | 2016 |
| Improving hit-and-run with single observations for continuous simulation optimization. | 0 | 0.34 | 2015 |
| Solvability in infinite horizon optimization. | 0 | 0.34 | 2015 |
| Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space. | 0 | 0.34 | 2014 |
| A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes. | 10 | 0.75 | 2013 |
| Fastest-Path Planning for Direction-Dependent Speed Functions. | 1 | 0.35 | 2013 |
| A Robust Complex Division in Scilab | 2 | 0.46 | 2012 |
| Pattern discrete and mixed Hit-and-Run for global optimization | 2 | 0.38 | 2011 |
| Sampled fictitious play for approximate dynamic programming | 3 | 0.42 | 2011 |
| A sampled fictitious play based learning algorithm for infinite horizon Markov Decision Processes | 4 | 0.45 | 2011 |
| Average Optimality in Nonhomogeneous Infinite Horizon Markov Decision Processes | 0 | 0.34 | 2011 |
| An analysis of a variation of hit-and-run for uniform sampling from general regions | 7 | 0.95 | 2011 |
| A Shadow Simplex Method for Infinite Linear Programs | 10 | 0.60 | 2010 |
| A Hit-and-Run approach for generating scale invariant Small World networks | 1 | 0.36 | 2009 |
| Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles | 9 | 0.61 | 2009 |
| Characterizing extreme points as basic feasible solutions in infinite linear programs | 7 | 0.55 | 2009 |
| Optimal Backlogging Over an Infinite Horizon Under Time-Varying Convex Production and Inventory Costs | 2 | 0.39 | 2009 |
| Adaptive search with stochastic acceptance probabilities for global optimization | 11 | 0.98 | 2008 |
| A Reach and Bound algorithm for acyclic dynamic-programming networks | 2 | 0.49 | 2008 |
| A dynamic programming approach to efficient sampling from Boltzmann distributions | 0 | 0.34 | 2008 |
| Infinite horizon optimality criteria for equipment replacement under technological change | 1 | 0.41 | 2007 |
| Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes | 9 | 0.65 | 2007 |
| An analytically derived cooling schedule for simulated annealing | 7 | 0.59 | 2007 |
| Extreme point characterizations for infinite network flow problems | 10 | 1.07 | 2006 |
| A Fictitious Play Approach to Large-Scale Optimization | 35 | 3.61 | 2005 |
| OPTIMALITY CRITERIA FOR DETERMINISTIC DISCRETE-TIME INFINITE HORIZON OPTIMIZATION | 6 | 1.08 | 2005 |
| Existence of efficient solutions in infinite horizon optimization under continuous and discrete controls | 2 | 0.96 | 2005 |
| Infinite Horizon Production Scheduling in Time-Varying Systems Under Stochastic Demand | 9 | 0.58 | 2004 |
| Optimal estimation of univariate black-box Lipschitz functions with upper and lower error bounds | 3 | 0.54 | 2003 |
| A paradox in equipment replacement under technological improvement | 8 | 1.53 | 2003 |
| A Finite Algorithm for Solving Infinite Dimensional Optimization Problems | 1 | 0.42 | 2001 |
| Implementing pure adaptive search for global optimization using Markov chain sampling | 6 | 0.81 | 2001 |
| Link travel time prediction for decentralized route guidance architectures | 21 | 3.65 | 2000 |
| Solving nonstationary infinite horizon stochastic production planning problems | 5 | 0.75 | 2000 |
| Parallel algorithms for solving aggregated shortest-path problems | 6 | 0.78 | 1999 |
| Shadow Prices in Infinite-Dimensional Linear Programming | 11 | 0.73 | 1998 |
| Direction Choice for Accelerated Convergence in Hit-And-Run Sampling | 29 | 2.27 | 1998 |
| Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems | 19 | 2.07 | 1998 |
| Existence and Discovery of Average Optimal Solutions in Deterministic Infinite Horizon Optimization | 5 | 1.16 | 1998 |
| Approximating Extreme Points of Infinite Dimensional Convex Sets | 3 | 0.56 | 1998 |
| The hit-and-run sampler: a globally reaching Markov chain sampler for generating arbitrary multivariate distributions | 11 | 0.84 | 1996 |
| Simulated annealing for constrained global optimization | 82 | 7.81 | 1994 |
| Hit-and-Run Algorithms for Generating Multivariate Distributions | 39 | 10.43 | 1993 |
| Improving Hit-and-Run for global optimization | 24 | 5.02 | 1993 |
| Conditions for the discovery of solution horizons | 13 | 1.42 | 1993 |
| A tie-breaking rule for discrete infinite horizon optimization | 9 | 1.45 | 1992 |
| Capacity expansion under stochastic demands | 24 | 7.03 | 1992 |
| Duality in infinite dimensional linear programming | 4 | 0.62 | 1992 |
| A theoretical basis for conditional probability analyses of neural discharge activity. | 0 | 0.34 | 1992 |
