Остановите войну!
for scientists:
default search action
Uriel G. Rothblum
- > Home > Persons > Uriel G. Rothblum
Publications
- 2016
- [j97]B. Curtis Eaves, Uriel G. Rothblum:
Generating approximate parametric roots of parametric polynomials. Ann. Oper. Res. 241(1-2): 515-573 (2016) - 2014
- [j95]B. Curtis Eaves, Uriel G. Rothblum:
An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms. Math. Oper. Res. 39(3): 607-623 (2014) - 2013
- [j94]Eric V. Denardo, Eugene A. Feinberg, Uriel G. Rothblum:
The multi-armed bandit, with constraints. Ann. Oper. Res. 208(1): 37-62 (2013) - 2012
- [j88]Eugene A. Feinberg, Uriel G. Rothblum:
Splitting Randomized Stationary Policies in Total-Reward Markov Decision Processes. Math. Oper. Res. 37(1): 129-153 (2012) - [j87]Eric V. Denardo, Eugene A. Feinberg, Uriel G. Rothblum:
Splitting in a finite Markov decision problem. SIGMETRICS Perform. Evaluation Rev. 39(4): 38 (2012) - [j86]Eric V. Denardo, Eugene A. Feinberg, Uriel G. Rothblum:
The multi-armed bandit, with constraints. SIGMETRICS Perform. Evaluation Rev. 39(4): 39 (2012) - 2008
- [c1]Eric V. Denardo, Eugene A. Feinberg, Uriel G. Rothblum:
On occupation measures for total-reward MDPs. CDC 2008: 4460-4465 - 2007
- [j67]Eric V. Denardo, Haechurl Park, Uriel G. Rothblum:
Risk-Sensitive and Risk-Neutral Multiarmed Bandits. Math. Oper. Res. 32(2): 374-394 (2007) - 2006
- [j61]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
- [j56]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) - [j55]B. Curtis Eaves, Peter W. Glynn, Uriel G. Rothblum:
The Mean Number-in-System Vector Range for Multiclass Queueing Networks. Math. Oper. Res. 29(1): 182-190 (2004) - 1999
- [j47]B. Curtis Eaves, Uriel G. Rothblum:
Arithmetic Continuation of Regular Roots of Formal Parametric Polynomial Systems. Comput. Optim. Appl. 12(1-3): 189-205 (1999) - 1995
- [j40]B. Curtis Eaves, Uriel G. Rothblum:
Linear Problems and Linear Algorithms. J. Symb. Comput. 20(2): 207-214 (1995) - [j38]Osman Güler, Alan J. Hoffman, Uriel G. Rothblum:
Approximations to Solutions to Systems of Linear Inequalities. SIAM J. Matrix Anal. Appl. 16(2): 688-696 (1995) - 1994
- [j32]B. Curtis Eaves, Uriel G. Rothblum:
Formulation of linear problems and solution by a universal machine. Math. Program. 65: 263-309 (1994) - 1993
- [j27]B. Curtis Eaves, Uriel G. Rothblum:
A class of "onto" multifunctions. Math. Program. 61: 327-343 (1993) - 1992
- [j23]B. Curtis Eaves, Uriel G. Rothblum:
Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields. Math. Program. 53: 307-321 (1992) - [j21]Earl R. Barnes, Alan J. Hoffman, Uriel G. Rothblum:
Optimal partitions having disjoint convex and conic hulls. Math. Program. 54: 69-86 (1992) - 1989
- [j16]B. Curtis Eaves, Uriel G. Rothblum:
A Theory on Extending Algorithms for Parametric Problems. Math. Oper. Res. 14(3): 502-533 (1989) - 1988
- [j15]B. Curtis Eaves, Uriel G. Rothblum:
A Discrete Time Average Cost Flexible Manufacturing and Operator Scheduling Model Solved by Deconvexification Over Time. Oper. Res. 36(2): 242-257 (1988) - 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
- [j8]Eric V. Denardo, Gur Huberman, Uriel G. Rothblum:
Optimal Locations on a Line Are Interleaved. Oper. Res. 30(4): 745-759 (1982) - 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)
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 2023-09-27 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint