| Publication | Date of Publication | Type |
|---|
Minimum spanning trees in infinite graphs: theory and algorithms
SIAM Journal on Optimization | 2024-10-22 | Paper |
A greedy algorithm for finding maximum spanning trees in infinite graphs
Operations Research Letters | 2022-12-12 | Paper |
A simplex method for countably infinite linear programs
SIAM Journal on Optimization | 2022-01-07 | Paper |
Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
Mathematical Programming. Series A. Series B | 2021-04-23 | Paper |
Single observation adaptive search for discrete and continuous stochastic optimization
Operations Research Letters | 2021-04-07 | Paper |
Single Observation Adaptive Search for Continuous Simulation Optimization
Operations Research | 2020-11-08 | Paper |
Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space
Operations Research Letters | 2018-09-28 | Paper |
Solvability in infinite horizon optimization
Operations Research Letters | 2018-09-28 | Paper |
A simplex method for uncapacitated pure-supply infinite network flow problems
SIAM Journal on Optimization | 2018-07-18 | Paper |
An analysis of a variation of hit-and-run for uniform sampling from general regions
ACM Transactions on Modeling and Computer Simulation | 2018-04-16 | Paper |
| Simplex algorithm for countable-state discounted Markov decision processes | 2017-09-26 | Paper |
Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem
Journal of Global Optimization | 2017-04-27 | Paper |
Parameter-free sampled fictitious play for solving deterministic dynamic programming problems
Journal of Optimization Theory and Applications | 2016-05-27 | Paper |
Fastest-path planning for direction-dependent speed functions
Journal of Optimization Theory and Applications | 2013-09-23 | Paper |
A linear programming approach to nonstationary infinite-horizon Markov decision processes
Operations Research | 2013-07-02 | Paper |
Discrete hit-and-run for sampling points from arbitrary distributions over subsets of integer hyperrectangles
Operations Research | 2011-11-24 | Paper |
A shadow simplex method for infinite linear programs
Operations Research | 2011-11-17 | Paper |
Pattern discrete and mixed hit-and-run for global optimization
Journal of Global Optimization | 2011-11-08 | Paper |
Sampled fictitious play for approximate dynamic programming
Computers & Operations Research | 2011-06-30 | Paper |
Average optimality in nonhomogeneous infinite horizon Markov decision processes
Mathematics of Operations Research | 2011-04-27 | Paper |
A Hit‐and‐Run approach for generating scale invariant Small World networks
Networks | 2009-07-28 | Paper |
A Fictitious Play Approach to Large-Scale Optimization
Operations Research | 2009-07-18 | Paper |
Infinite Horizon Production Scheduling in Time-Varying Systems Under Stochastic Demand
Operations Research | 2009-07-10 | Paper |
A Reach and Bound algorithm for acyclic dynamic-programming networks
Networks | 2009-06-16 | Paper |
Characterizing extreme points as basic feasible solutions in infinite linear programs
Operations Research Letters | 2009-02-23 | Paper |
A dynamic programming approach to efficient sampling from Boltzmann distributions
Operations Research Letters | 2009-01-09 | Paper |
Adaptive search with stochastic acceptance probabilities for global optimization
Operations Research Letters | 2008-09-10 | Paper |
Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes
Mathematics of Operations Research | 2008-05-27 | Paper |
An analytically derived cooling schedule for simulated annealing
Journal of Global Optimization | 2007-11-14 | Paper |
Infinite horizon optimality criteria for equipment replacement under technological change
Operations Research Letters | 2007-10-30 | Paper |
Convergence of minimum norm elements of projections and intersections of nested affine spaces in Hilbert space
Journal of Mathematical Analysis and Applications | 2007-04-10 | Paper |
Extreme point characterizations for infinite network flow problems
Networks | 2007-02-02 | Paper |
Optimality criteria for deterministic discrete-time infinite horizon optimization
International Journal of Mathematics and Mathematical Sciences | 2005-10-24 | Paper |
Existence of efficient solutions in infinite horizon optimization under continuous and discrete controls
Operations Research Letters | 2004-11-19 | Paper |
Optimal estimation of univariate black-box Lipschitz functions with upper and lower error bounds.
Computers & Operations Research | 2004-02-14 | Paper |
Direction choice for accelerated convergence in hit-and-run sampling
Operations Research | 2003-05-05 | Paper |
A paradox in equipment replacement under technological improvement
Operations Research Letters | 2003-05-04 | Paper |
On the closure of the sum of closed subspaces
International Journal of Mathematics and Mathematical Sciences | 2003-03-14 | Paper |
Infinite horizon production planning in time-varying systems with convex production and inventory costs
Management Science | 2002-04-17 | Paper |
Markov perfect equilibrium existence for a class of undiscounted infinite-horizon dynamic games
Journal of Optimization Theory and Applications | 2002-02-12 | Paper |
Shadow prices in infinite-dimensional linear programming
Mathematics of Operations Research | 2001-11-26 | Paper |
Existence and discovery of average optimal solutions in deterministic infinite horizon optimization
Mathematics of Operations Research | 2001-11-26 | Paper |
Approximating extreme points of infinite-dimensional convex sets
Mathematics of Operations Research | 2001-11-26 | Paper |
A finite algorithm for solving infinite dimensional optimization problems
Annals of Operations Research | 2001-10-31 | Paper |
Implementing pure adaptive search for global optimization using Markov chain sampling
Journal of Global Optimization | 2001-08-28 | Paper |
Solving nonstationary infinite horizon stochastic production planning problems
Operations Research Letters | 2001-01-25 | Paper |
Solving nonstationary infinite horizon dynamic optimization problems
Journal of Mathematical Analysis and Applications | 2000-12-14 | Paper |
Parallel algorithms for solving aggregated shortest-path problems
Computers & Operations Research | 1999-09-22 | Paper |
Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems
INFORMS Journal on Computing | 1998-01-01 | Paper |
| scientific article; zbMATH DE number 1099087 (Why is no real title available?) | 1997-12-18 | Paper |
Solution existence for time-varying infinite horizon quadratic programming
Journal of Mathematical Analysis and Applications | 1996-08-19 | Paper |
| scientific article; zbMATH DE number 830005 (Why is no real title available?) | 1996-02-01 | Paper |
Simulated annealing for constrained global optimization
Journal of Global Optimization | 1994-10-30 | Paper |
Solution approximation in infinite horizon linear quadratic control
IEEE Transactions on Automatic Control | 1994-09-21 | Paper |
Optimal average value convergence in nonhomogeneous Markov decision processes
Journal of Mathematical Analysis and Applications | 1994-05-09 | Paper |
| Equipment replacement under technological change | 1994-04-13 | Paper |
Conditions for the discovery of solution horizons
Mathematical Programming. Series A. Series B | 1993-08-22 | Paper |
Improving hit-and-run for global optimization
Journal of Global Optimization | 1993-08-15 | Paper |
Hit-and-Run Algorithms for Generating Multivariate Distributions
Mathematics of Operations Research | 1993-08-05 | Paper |
Finite dimensional approximation in infinite dimensional mathematical programming
Mathematical Programming. Series A. Series B | 1993-01-16 | Paper |
Rolling Horizon Procedures in Nonhomogeneous Markov Decision Processes
Operations Research | 1993-01-16 | Paper |
A Stopping Rule for Forecasting Horizons in Nonhomogeneous Markov Decision Processes
Operations Research | 1993-01-16 | Paper |
Convergence of best approximations from unbounded sets
Journal of Mathematical Analysis and Applications | 1992-09-27 | Paper |
Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra
Operations Research | 1992-09-26 | Paper |
| scientific article; zbMATH DE number 38300 (Why is no real title available?) | 1992-06-28 | Paper |
Duality in infinite dimensional linear programming
Mathematical Programming. Series A. Series B | 1992-06-28 | Paper |
Pure adaptive search in global optimization
Mathematical Programming. Series A. Series B | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 19230 (Why is no real title available?) | 1992-06-26 | Paper |
Convergence of selections with applications in optimization
Journal of Mathematical Analysis and Applications | 1991-01-01 | Paper |
| A correspondence principle for relative entropy minimization | 1990-01-01 | Paper |
Denumerable state nonhomogeneous Markov decision processes
Journal of Mathematical Analysis and Applications | 1990-01-01 | Paper |
Deterministic Equivalence in Stochastic Infinite Horizon Problems
Mathematics of Operations Research | 1990-01-01 | Paper |
Pure adaptive search in Monte Carlo optimization
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
Infinite Horizon Optimization
Mathematics of Operations Research | 1989-01-01 | Paper |
| Forecast horizons for the discounted dynamic lot-size problem allowing speculative motive | 1987-01-01 | Paper |
A New Optimality Criterion for Nonhomogeneous Markov Decision Processes
Operations Research | 1987-01-01 | Paper |
Aggregation in Dynamic Programming
Operations Research | 1987-01-01 | Paper |
Hit-and-run algorithms for the identification of nonredundant linear inequalities
Mathematical Programming | 1987-01-01 | Paper |
The expected number of extreme points of a random linear program
Mathematical Programming | 1986-01-01 | Paper |
Optimal Capacity Expansion Over an Infinite Horizon
Management Science | 1985-01-01 | Paper |
An information theory model for the evaluation of circumstantial evidence
IEEE Transactions on Systems, Man, and Cybernetics | 1985-01-01 | Paper |
Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
Operations Research | 1984-01-01 | Paper |
Conditions for the Existence of Planning Horizons
Mathematics of Operations Research | 1984-01-01 | Paper |
Random Procedures for Nonredundant Constraint Identification in Stochastic Linear Programs
American Journal of Mathematical and Management Sciences | 1984-01-01 | Paper |
Technical Note—The Asymptotic Extreme Value Distribution of the Sample Minimum of a Concave Function under Linear Constraints
Operations Research | 1983-01-01 | Paper |
Random polytopes: Their definition, generation and aggregate properties
Mathematical Programming | 1982-01-01 | Paper |
Assessing Risks Through the Determination of Rare Event Probabilities
Operations Research | 1982-01-01 | Paper |
Turnpike Results for Single Location Capacity Expansion
Management Science | 1979-01-01 | Paper |
An elementary proof of the duality theorem of linear programming
Journal of Optimization Theory and Applications | 1973-01-01 | Paper |
