Eric V. Denardo

From MaRDI portal
Person:378725

Available identifiers

zbMath Open denardo.eric-vMaRDI QIDQ378725

List of research outcomes





PublicationDate of PublicationType
The multi-armed bandit, with constraints2013-11-12Paper
Linear programming and generalizations. A problem-based introduction with spreadsheets2010-08-11Paper
Risk-Sensitive and Risk-Neutral Multiarmed Bandits2008-05-27Paper
A Turnpike Theorem For A Risk-Sensitive Markov Decision Process with Stopping2007-03-27Paper
Index Policies for Stochastic Search in a Forest with an Application to R&D Project Management2005-11-11Paper
Totally expanding multiplicative systems2005-09-28Paper
https://portal.mardi4nfdi.de/entity/Q44273132003-09-21Paper
https://portal.mardi4nfdi.de/entity/Q42311401999-03-10Paper
Stochastic monotonicity for stationary recurrence times of first passage heights1997-08-25Paper
Control of a Stochastic Production System with Estimated Parameters1997-01-01Paper
Managing Uncertainty in a Serial Production Line1996-07-24Paper
A nonlinear allocation problem1995-03-16Paper
Linear Control of a Markov Production System1992-09-27Paper
Error bound for the dynamic lot size model with backlogging1991-01-01Paper
Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches1988-01-01Paper
Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants1988-01-01Paper
A Transportation Problem in Which Costs Depend on the Order of Arrival1988-01-01Paper
Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model1986-01-01Paper
Affine Structure and Invariant Policies for Dynamic Programs1983-01-01Paper
Optimal Locations on a Line Are Interleaved1982-01-01Paper
Technical Note—Enforcing Constraints on Expanded Networks1980-01-01Paper
Shortest-Route Methods: 1. Reaching, Pruning, and Buckets1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41861141979-01-01Paper
Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound1979-01-01Paper
Overtaking Optimality for Markov Decision Chains1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39087851978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39087861978-01-01Paper
Periods of Connected Networks and Powers of Nonnegative Matrices1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56845281973-01-01Paper
Markov Renewal Programs with Small Interest Rates1971-01-01Paper
On Linear Programming in a Markov Decision Problem1970-01-01Paper
Computing a Bias-Optimal Policy in a Discrete-Time Markov Decision Problem1970-01-01Paper
Multichain Markov Renewal Programs1968-01-01Paper
Separable Markovian Decision Problems1968-01-01Paper
An Optimality Condition for Discrete Dynamic Programming with no Discounting1968-01-01Paper
Contraction Mappings in the Theory Underlying Dynamic Programming1967-01-01Paper

Research outcomes over time

This page was built for person: Eric V. Denardo