The following pages link to Robert L. Smith (Q200435):
Displaying 39 items.
- Extreme point characterizations for infinite network flow problems (Q3418208) (← links)
- A correspondence principle for relative entropy minimization (Q3472036) (← links)
- A Reach and Bound algorithm for acyclic dynamic-programming networks (Q3632964) (← links)
- Infinite Horizon Production Scheduling in Time-Varying Systems Under Stochastic Demand (Q3637413) (← links)
- Technical Note—The Asymptotic Extreme Value Distribution of the Sample Minimum of a Concave Function under Linear Constraints (Q3666043) (← links)
- An information theory model for the evaluation of circumstantial evidence (Q3734957) (← links)
- Optimal Capacity Expansion Over an Infinite Horizon (Q3737160) (← links)
- Aggregation in Dynamic Programming (Q3773725) (← links)
- Forecast horizons for the discounted dynamic lot-size problem allowing speculative motive (Q3793912) (← links)
- A New Optimality Criterion for Nonhomogeneous Markov Decision Processes (Q3796986) (← links)
- Infinite Horizon Optimization (Q3833893) (← links)
- Turnpike Results for Single Location Capacity Expansion (Q3853423) (← links)
- Random polytopes: Their definition, generation and aggregate properties (Q3953557) (← links)
- An exact aggregation-disaggregation algorithm for mandatory set decomposable Markov chains (Q3976662) (← links)
- A tie-breaking rule for discrete infinite horizon optimization (Q3990571) (← links)
- Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra (Q4006337) (← links)
- Rolling Horizon Procedures in Nonhomogeneous Markov Decision Processes (Q4016942) (← links)
- A Stopping Rule for Forecasting Horizons in Nonhomogeneous Markov Decision Processes (Q4016943) (← links)
- Equipment replacement under technological change (Q4279276) (← links)
- Solution approximation in infinite horizon linear quadratic control (Q4306717) (← links)
- (Q4369273) (← links)
- Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems (Q4427339) (← links)
- An analysis of a variation of hit-and-run for uniform sampling from general regions (Q4635178) (← links)
- The expected number of extreme points of a random linear program (Q4726040) (← links)
- Assessing Risks Through the Determination of Rare Event Probabilities (Q4742215) (← links)
- An exact aggregation/disaggregation algorithm for large scale Markov chains (Q4859571) (← links)
- A Simplex Method for Countably Infinite Linear Programs (Q5020851) (← links)
- Single Observation Adaptive Search for Continuous Simulation Optimization (Q5131547) (← links)
- A Hit‐and‐Run approach for generating scale invariant Small World networks (Q5191130) (← links)
- Hit-and-Run Algorithms for Generating Multivariate Distributions (Q5287980) (← links)
- A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes (Q5301136) (← links)
- A Fictitious Play Approach to Large-Scale Optimization (Q5322106) (← links)
- Simplex Algorithm for Countable-State Discounted Markov Decision Processes (Q5360841) (← links)
- Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes (Q5388015) (← links)
- Deterministic Equivalence in Stochastic Infinite Horizon Problems (Q5749163) (← links)
- Implementing pure adaptive search for global optimization using Markov chain sampling (Q5942318) (← links)
- A finite algorithm for solving infinite dimensional optimization problems (Q5948173) (← links)
- On the closure of the sum of closed subspaces (Q5954784) (← links)
- Minimum spanning trees in infinite graphs: theory and algorithms (Q6622744) (← links)
