Eric V. Denardo

According to our database1, Eric V. Denardo authored at least 22 papers between 1967 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
The multi-armed bandit, with constraints.
Ann. Oper. Res., 2013

2012
Splitting in a finite Markov decision problem.
SIGMETRICS Perform. Evaluation Rev., 2012

2008
On occupation measures for total-reward MDPs.
Proceedings of the 47th IEEE Conference on Decision and Control, 2008

2007
Risk-Sensitive and Risk-Neutral Multiarmed Bandits.
Math. Oper. Res., 2007

2006
A Turnpike Theorem For A Risk-Sensitive Markov Decision Process with Stopping.
SIAM J. Control. Optim., 2006

2004
Index Policies for Stochastic Search in a Forest with an Application to R&D Project Management.
Math. Oper. Res., 2004

1996
Managing Uncertainty in a Serial Production Line.
Oper. Res., 1996

1994
A nonlinear allocation problem.
IBM J. Res. Dev., 1994

1992
Linear Control of a Markov Production System.
Oper. Res., 1992

1988
Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants.
Oper. Res., 1988

Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches.
Oper. Res., 1988

1986
Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model.
Math. Oper. Res., 1986

1983
Affine Structure and Invariant Policies for Dynamic Programs.
Math. Oper. Res., 1983

1982
Optimal Locations on a Line Are Interleaved.
Oper. Res., 1982

1980
Technical Note - Enforcing Constraints on Expanded Networks.
Oper. Res., 1980

1979
Optimal stopping, exponential utility, and linear programming.
Math. Program., 1979

Overtaking Optimality for Markov Decision Chains.
Math. Oper. Res., 1979

Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound.
Oper. Res., 1979

Shortest-Route Methods: 1. Reaching, Pruning, and Buckets.
Oper. Res., 1979

1977
Periods of Connected Networks and Powers of Nonnegative Matrices.
Math. Oper. Res., 1977

1970
Computing a Bias-Optimal Policy in a Discrete-Time Markov Decision Problem.
Oper. Res., 1970

1967
Letter to the Editor - Nonoptimality of Planned Replacement in Intervals of Decreasing Failure Rate.
Oper. Res., 1967


  Loading...