default search action
Uriel G. Rothblum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2017
- [j98]Boaz Golany, Noam Goldberg
, Uriel G. Rothblum:
A two-resource allocation algorithm with an application to large-scale zero-sum defensive games. Comput. Oper. Res. 78: 218-229 (2017) - 2016
- [j97]B. Curtis Eaves, Uriel G. Rothblum:
Generating approximate parametric roots of parametric polynomials. Ann. Oper. Res. 241(1-2): 515-573 (2016) - 2015
- [j96]Boaz Golany, Noam Goldberg
Allocating multiple defensive resources in a zero-sum game setting. Ann. Oper. Res. 225(1): 91-109 (2015) - 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) - [j93]Pelin G. Canbolat
(Approximate) iterated successive approximations algorithm for sequential decision processes. Ann. Oper. Res. 208(1): 309-320 (2013) - 2012
- [j92]Boaz Golany, Moshe Kress, Michal Penn, Uriel G. Rothblum:
Network Optimization Models for Resource Allocation in Developing Military Countermeasures. Oper. Res. 60(1): 48-63 (2012) - [j91]Pelin G. Canbolat
A Stochastic Competitive R&D Race Where "Winner Takes All". Oper. Res. 60(3): 700-715 (2012) - [j90]Huilan Chang, Frank K. Hwang, Uriel G. Rothblum:
A new approach to solve open-partition problems. J. Comb. Optim. 23(1): 61-78 (2012) - [j89]Pelin G. Canbolat
A Stochastic Competitive Research and Development Race Where "Winner Takes All" with Lower and Upper Bounds. J. Optim. Theory Appl. 154(3): 986-1014 (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) - 2011
- [j85]Yael Deutsch, Boaz Golany, Uriel G. Rothblum:
Determining all Nash equilibria in a (bi-linear) inspection game. Eur. J. Oper. Res. 215(2): 422-430 (2011) - [j84]Frank K. Hwang, Uriel G. Rothblum:
On the number of separable partitions. J. Comb. Optim. 21(4): 423-433 (2011) - [j83]Boaz Golany, Konstantin Kogan
A Generalized Two-Agent Location Problem: Asymmetric Dynamics and Coordination. J. Optim. Theory Appl. 148(2): 336-363 (2011) - 2010
- [j82]Nitsan Perach, Uriel G. Rothblum:
Incentive compatibility for the stable matching model with an entrance criterion. Int. J. Game Theory 39(4): 657-667 (2010) - [j81]Arkadi Nemirovski
Accuracy Certificates for Computational Problems with Convex Structure. Math. Oper. Res. 35(1): 52-78 (2010)
2000 – 2009
- 2009
- [j80]Boaz Golany, Edward H. Kaplan
Nature plays with dice - terrorists do not: Allocating resources to counter strategic versus probabilistic risks. Eur. J. Oper. Res. 192(1): 198-208 (2009) - [j79]Uriel G. Rothblum:
Efficient Solution of a Stochastic Scheduling Problem on an Out-Forest---Revisited. SIAM J. Optim. 20(2): 903-914 (2009) - 2008
- [j78]Avi Berman, Shmuel Friedland, Leslie Hogben, Uriel G. Rothblum, Bryan L. Shader:
Minimum Rank of Matrices Described by a Graph or Pattern over the Rational, Real and Complex Numbers. Electron. J. Comb. 15(1) (2008) - [j77]Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum:
The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. Discret. Appl. Math. 156(4): 407-408 (2008) - [j76]Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum:
Editorial. Discret. Appl. Math. 156(4): 410-411 (2008) - [j75]Uriel G. Rothblum, Yoav Tangir:
The partition bargaining problem. Discret. Appl. Math. 156(4): 428-443 (2008) - [j74]Boaz Golany, Frank K. Hwang, Uriel G. Rothblum:
Sphere-separable partitions of multi-parameter elements. Discret. Appl. Math. 156(6): 838-845 (2008) - [j73]Frank K. Hwang, J. S. Lee, Uriel G. Rothblum:
Equivalence of permutation polytopes corresponding to strictly supermodular functions. Discret. Appl. Math. 156(12): 2336-2343 (2008) - [j72]Uriel G. Rothblum, Jay Sethuraman:
Stochastic scheduling in an in-forest. Discret. Optim. 5(2): 457-466 (2008) - [j71]Nitsan Perach, Julia Polak, Uriel G. Rothblum:
A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the technion. Int. J. Game Theory 36(3-4): 519-535 (2008) - [j70]Boaz Golany, Uriel G. Rothblum:
Optimal investment in development projects. Oper. Res. Lett. 36(6): 657-661 (2008) - [c2]Eric V. Denardo, Eugene A. Feinberg, Uriel G. Rothblum:
On occupation measures for total-reward MDPs. CDC 2008: 4460-4465 - 2007
- [j69]Nir Halman, Shmuel Onn
The convex dimension of a graph. Discret. Appl. Math. 155(11): 1373-1383 (2007) - [j68]Shmuel Onn
The use of edge-directions and linear programming to enumerate vertices. J. Comb. Optim. 14(2-3): 153-164 (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) - [j66]Uriel G. Rothblum:
Bounding the inefficiency of Nash equilibria in games with finitely many players. Oper. Res. Lett. 35(6): 700-706 (2007) - [j65]Uriel G. Rothblum, Robert Shorten:
Nonlinear AIMD Congestion Control and Contraction Mappings. SIAM J. Control. Optim. 46(5): 1882-1896 (2007) - 2006
- [j64]F. H. Chang, H. B. Chen, J. Y. Guo, Frank K. Hwang, Uriel G. Rothblum:
One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions. J. Comb. Optim. 11(3): 321-339 (2006) - [j63]Frank K. Hwang, Uriel G. Rothblum:
A Polytope Approach to the Optimal Assembly Problem. J. Glob. Optim. 35(3): 387-403 (2006) - [j62]Fei-Hwang Chang, Frank K. Hwang, Uriel G. Rothblum:
The Mean-Partition Problem. J. Glob. Optim. 36(1): 21-31 (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) - [c1]Uriel G. Rothblum, Robert Shorten:
Nonlinear AIMD Congestion Control and Contraction Mappings. POSTA 2006: 193-200 - 2005
- [j60]Shmuel Onn
Edge-Directions of Standard Polyhedra with Applications to Network Flows. J. Glob. Optim. 33(1): 109-122 (2005) - 2004
- [j59]Frank K. Hwang, J. S. Lee, Uriel G. Rothblum:
Permutation polytopes corresponding to strongly supermodular functions. Discret. Appl. Math. 142(1-3): 87-97 (2004) - [j58]Shmuel Onn
Convex Combinatorial Optimization. Discret. Comput. Geom. 32(4): 549-566 (2004) - [j57]Uriel G. Rothblum:
A Comment on: F.K. Hwang, Y.M. Wang and J.S. Lee, 'Sortability of Multi-Partitions', Journal of Global Optimization 24 (2002), pp. 463-472. J. Glob. Optim. 29(1): 121-123 (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) - [j54]Uriel G. Rothblum:
Tales of Hoffman. Oper. Res. Lett. 32(6): 591-594 (2004) - [j53]Frank Kwang-Ming Hwang, Uriel G. Rothblum:
Partition-Optimization with Schur Convex Sum Objective Functions. SIAM J. Discret. Math. 18(3): 512-524 (2004) - 2003
- [j52]Frank K. Hwang, J. S. Lee, Yu-Chi Liu
Sortability of vector partitions. Discret. Math. 263(1-3): 129-142 (2003) - [i1]Shmuel Onn, Uriel G. Rothblum:
Convex Combinatorial Optimization. CoRR math.CO/0309083 (2003) - 2002
- [j51]Sharon Aviran, Nissan Lev-Tov, Shmuel Onn
Vertex characterization of partition polytopes of bipartitions and of planar point sets. Discret. Appl. Math. 124(1-3): 1-15 (2002) - [j50]Yosef Blum, Uriel G. Rothblum:
"Timing Is Everything" and Marital Bliss. J. Econ. Theory 103(2): 429-443 (2002) - 2000
- [j49]Frank K. Hwang, Shmuel Onn
Linear-shaped partition problems. Oper. Res. Lett. 26(4): 159-163 (2000) - [j48]Peter L. Hammer, Alexander Kogan, Uriel G. Rothblum:
Evaluation, Strength, and Relevance of Variables of Boolean Functions. SIAM J. Discret. Math. 13(3): 302-312 (2000)
1990 – 1999
- 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) - [j46]Biao Gao, Frank K. Hwang, Wen-Ching Winnie Li, Uriel G. Rothblum:
Partition polytopes over 1-dimensional points. Math. Program. 85(2): 335-362 (1999) - [j45]Frank K. Hwang, Shmuel Onn
A Polynomial Time Algorithm for Shaped Partition Problems. SIAM J. Optim. 10(1): 70-81 (1999) - 1998
- [j44]Gerard J. Chang, Fu-Loong Chen, Lingling Huang, Frank K. Hwang, Su-Tzu Nuan, Uriel G. Rothblum, I-Fan Sun, Jan-Wen Wang, Hong-Gwa Yeh:
Sortabilities of Partition Properties. J. Comb. Optim. 2(4): 413-427 (1998) - 1996
- [j43]Frank K. Hwang, Uriel G. Rothblum, Yi-Ching Yao
Localizing combinatorial properties of partitions. Discret. Math. 160(1-3): 1-23 (1996) - [j42]Frank K. Hwang, Uriel G. Rothblum:
Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions. Math. Oper. Res. 21(3): 540-554 (1996) - 1995
- [j41]Hernán G. Abeledo, Uriel G. Rothblum:
Paths to Marriage Stability. Discret. Appl. Math. 63(1): 1-12 (1995) - [j40]B. Curtis Eaves, Uriel G. Rothblum:
Linear Problems and Linear Algorithms. J. Symb. Comput. 20(2): 207-214 (1995) - [j39]Frank K. Hwang, Uriel G. Rothblum:
Assembly at system level versus component level. Oper. Res. Lett. 17(4): 153-157 (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
- [j37]Frank K. Hwang, Uriel G. Rothblum:
Constrained partitioning problems. Discret. Appl. Math. 50(1): 93-96 (1994) - [j36]Hernán G. Abeledo, Uriel G. Rothblum:
Stable Matchings and Linear Inequalities. Discret. Appl. Math. 54(1): 1-27 (1994) - [j35]Uriel G. Rothblum, Michael H. Rothkopf:
Dynamic Recomputation Cannot Extend the Optimality-Range of Priority Indices. Oper. Res. 42(4): 669-676 (1994) - [j34]Frank K. Hwang, Uriel G. Rothblum:
Optimality of Monotone Assemblies for Coherent Systems Composed of Series Modules. Oper. Res. 42(4): 709-720 (1994) - [j33]Rachelle S. Klein, Hanan Luss, Uriel G. Rothblum:
Relaxation-based algorithms for minimax optimization problems with resource allocation applications. Math. Program. 64: 337-363 (1994) - [j32]B. Curtis Eaves, Uriel G. Rothblum:
Formulation of linear problems and solution by a universal machine. Math. Program. 65: 263-309 (1994) - [j31]Uriel G. Rothblum, Hans Schneider, Michael H. Schneider:
Scaling Matrices to Prescribed Row and Column Maxima. SIAM J. Matrix Anal. Appl. 15(1): 1-14 (1994) - 1993
- [j30]Rachelle S. Klein, Hanan Luss, Uriel G. Rothblum:
Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs. Oper. Res. 41(5): 959-971 (1993) - [j29]Alvin E. Roth, Uriel G. Rothblum, John H. Vande Vate:
Stable Matchings, Optimal Assignments, and Linear Programming. Math. Oper. Res. 18(4): 803-828 (1993) - [j28]Frank K. Hwang, Uriel G. Rothblum:
Majorization and Schur Convexity with Respect to Partial Orders. Math. Oper. Res. 18(4): 928-944 (1993) - [j27]B. Curtis Eaves, Uriel G. Rothblum:
A class of "onto" multifunctions. Math. Program. 61: 327-343 (1993) - [j26]Frank K. Hwang, Uriel G. Rothblum, Larry A. Shepp:
Monotone Optimal Multipartitions Using Schur Convexity with Respect to Partial Orders. SIAM J. Discret. Math. 6(4): 533-547 (1993) - [j25]Orna Gross, Uriel G. Rothblum:
Approximations of the Spectral Radius Corresponding Eigenvector, and Second Largest Modulus of an Eigenvalue for Square, Nonnegative, Irreducible Matrices. SIAM J. Matrix Anal. Appl. 14(1): 15-32 (1993) - 1992
- [j24]Uriel G. Rothblum, Hans Schneider, Michael H. Schneider:
Characterizations of Max-Balanced Flows. Discret. Appl. Math. 39(3): 241-261 (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) - [j22]Uriel G. Rothblum:
Characterization of stable matchings as extreme points of a polytope. Math. Program. 54: 57-67 (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) - [j20]Frank K. Hwang, Uriel G. Rothblum:
Generalization of an engineering principle. Oper. Res. Lett. 12(4): 197-199 (1992) - [j19]Uriel G. Rothblum:
Linear Inequality Scaling Problems. SIAM J. Optim. 2(4): 635-648 (1992) - 1991
- [j18]Costas Courcoubetis, Uriel G. Rothblum:
On Optimal Packing of Randomly Arriving Objects. Math. Oper. Res. 16(1): 176-194 (1991) - 1990
- [j17]Meir J. Rosenblatt, Uriel G. Rothblum:
On the Single Resource Capacity Problem for Multi-Item Inventory Systems. Oper. Res. 38(4): 686-693 (1990)
1980 – 1989
- 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) - 1985
- [j14]Amiya K. Chakravarty, James B. Orlin, Uriel G. Rothblum:
Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment. Oper. Res. 33(4): 820-834 (1985) - [j13]James B. Orlin
Computing optimal scalings by parametric network algorithms. Math. Program. 32(1): 1-10 (1985) - [j12]Uriel G. Rothblum:
Ratios of affine functions. Math. Program. 32(3): 357-365 (1985) - 1984
- [j11]Uriel G. Rothblum:
Multiplicative Markov Decision Chains. Math. Oper. Res. 9(1): 6-24 (1984) - 1983
- [j10]Eric V. Denardo, Uriel G. Rothblum:
Affine Structure and Invariant Policies for Dynamic Programs. Math. Oper. Res. 8(3): 342-365 (1983) - [j9]Manfred von Golitschek, Uriel G. Rothblum, Hans Schneider:
A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds. Math. Program. 27(3): 291-306 (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) - [j7]Uriel G. Rothblum, Peter Whittle:
Growth Optimality for Branching Markov Decision Chains. Math. Oper. Res. 7(4): 582-601 (1982) - 1980
- [j6]Uriel G. Rothblum, Hans Schneider:
Characterizations of optimal scalings of matrices. Math. Program. 19(1): 121-136 (1980)
1970 – 1979
- 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) - 1978
- [j3]Uriel G. Rothblum:
On solving optimization problems with proportion-constraints. Math. Program. 15(1): 77-86 (1978) - 1976
- [j2]Uriel G. Rothblum:
On the number of complementary trees in a graph. Discret. Math. 15(4): 359-371 (1976) - 1975
- [j1]Uriel G. Rothblum:
Normalized Markov Decision Chains I; Sensitive Discount Optimality. Oper. Res. 23(4): 785-795 (1975)
Coauthor Index
Frank K. Hwang
aka: Frank Kwang-Ming Hwang
aka: Frank Kwang-Ming Hwang
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:08 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: