default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric V. Denardo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
[j22]Eric V. Denardo, Eugene A. Feinberg, Uriel G. Rothblum:
The multi-armed bandit, with constraints. Ann. Oper. Res. 208(1): 37-62 (2013)- 2012
- [j21]Eric V. Denardo, Eugene A. Feinberg, Uriel G. Rothblum:
Splitting in a finite Markov decision problem. SIGMETRICS Perform. Evaluation Rev. 39(4): 38 (2012) - [j20]Eric V. Denardo, Eugene A. Feinberg, Uriel G. Rothblum:
The multi-armed bandit, with constraints. SIGMETRICS Perform. Evaluation Rev. 39(4): 39 (2012) - 2007
- [j19]Eric V. Denardo, Haechurl Park, Uriel G. Rothblum:
Risk-Sensitive and Risk-Neutral Multiarmed Bandits. Math. Oper. Res. 32(2): 374-394 (2007) - 2006
- [j18]Eric V. Denardo, Uriel G. Rothblum:
A Turnpike Theorem For A Risk-Sensitive Markov Decision Process with Stopping. SIAM J. Control. Optim. 45(2): 414-431 (2006) - 2004
- [j17]Eric V. Denardo, Uriel G. Rothblum, Ludo van der Heyden:
Index Policies for Stochastic Search in a Forest with an Application to R&D Project Management. Math. Oper. Res. 29(1): 162-181 (2004) - 1996
- [j16]Eric V. Denardo, Thomas Y. S. Lee:
Managing Uncertainty in a Serial Production Line. Oper. Res. 44(2): 382-392 (1996) - 1994
- [j15]Eric V. Denardo, Alan J. Hoffman, Todd Mackenzie, William R. Pulleyblank:
A nonlinear allocation problem. IBM J. Res. Dev. 38(3): 301-306 (1994) - 1992
- [j14]Eric V. Denardo, Christopher S. Tang:
Linear Control of a Markov Production System. Oper. Res. 40(2): 259-278 (1992) - 1988
- [j13]Christopher S. Tang, Eric V. Denardo:
Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches. Oper. Res. 36(5): 767-777 (1988) - [j12]Christopher S. Tang, Eric V. Denardo:
Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants. Oper. Res. 36(5): 778-784 (1988) - 1986
- [j11]Chung-Yee Lee, Eric V. Denardo:
Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model. Math. Oper. Res. 11(3): 423-432 (1986) - 1983
- [j10]Eric V. Denardo, Uriel G. Rothblum:
Affine Structure and Invariant Policies for Dynamic Programs. Math. Oper. Res. 8(3): 342-365 (1983) - 1982
- [j9]Eric V. Denardo, Gur Huberman, Uriel G. Rothblum:
Optimal Locations on a Line Are Interleaved. Oper. Res. 30(4): 745-759 (1982) - 1980
- [j8]Eric V. Denardo, Bennett L. Fox:
Technical Note - Enforcing Constraints on Expanded Networks. Oper. Res. 28(5): 1213-1218 (1980) - 1979
- [j7]Eric V. Denardo, Bennett L. Fox:
Shortest-Route Methods: 1. Reaching, Pruning, and Buckets. Oper. Res. 27(1): 161-186 (1979) - [j6]Eric V. Denardo, Bennett L. Fox:
Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound. Oper. Res. 27(3): 548-566 (1979) - [j5]Eric V. Denardo, Uriel G. Rothblum:
Overtaking Optimality for Markov Decision Chains. Math. Oper. Res. 4(2): 144-152 (1979) - [j4]Eric V. Denardo, Uriel G. Rothblum:
Optimal stopping, exponential utility, and linear programming. Math. Program. 16(1): 228-244 (1979) - 1977
- [j3]Eric V. Denardo:
Periods of Connected Networks and Powers of Nonnegative Matrices. Math. Oper. Res. 2(1): 20-24 (1977) - 1970
- [j2]Eric V. Denardo:
Computing a Bias-Optimal Policy in a Discrete-Time Markov Decision Problem. Oper. Res. 18(2): 279-289 (1970) - 1967
- [j1]Eric V. Denardo, Bennett L. Fox:
Letter to the Editor - Nonoptimality of Planned Replacement in Intervals of Decreasing Failure Rate. Oper. Res. 15(2): 358-359 (1967)
Conference and Workshop Papers
- 2008
- [c1]Eric V. Denardo, Eugene A. Feinberg, Uriel G. Rothblum:
On occupation measures for total-reward MDPs. CDC 2008: 4460-4465
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
