Normalized Markov Decision Chains I; Sensitive Discount Optimality. - Uriel G. Rothblum (Oper. Res., 1975)

On the number of complementary trees in a graph. - Uriel G. Rothblum (Discret. Math., 1976)

On solving optimization problems with proportion-constraints. - Uriel G. Rothblum (Math. Program., 1978)

Overtaking Optimality for Markov Decision Chains. - Eric V. Denardo; Uriel G. Rothblum (Math. Oper. Res., 1979)

Optimal stopping, exponential utility, and linear programming. - Eric V. Denardo; Uriel G. Rothblum (Math. Program., 1979)

Characterizations of optimal scalings of matrices. - Uriel G. Rothblum; Hans Schneider (Math. Program., 1980)

Optimal Locations on a Line Are Interleaved. - Eric V. Denardo; Gur Huberman; Uriel G. Rothblum (Oper. Res., 1982)

Growth Optimality for Branching Markov Decision Chains. - Uriel G. Rothblum; Peter Whittle (Math. Oper. Res., 1982)

Affine Structure and Invariant Policies for Dynamic Programs. - Eric V. Denardo; Uriel G. Rothblum (Math. Oper. Res., 1983)

A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds. - Manfred von Golitschek; Uriel G. Rothblum; Hans Schneider (Math. Program., 1983)

Multiplicative Markov Decision Chains. - Uriel G. Rothblum (Math. Oper. Res., 1984)

Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment. - Amiya K. Chakravarty; James B. Orlin; Uriel G. Rothblum (Oper. Res., 1985)

Computing optimal scalings by parametric network algorithms. - James B. Orlin; Uriel G. Rothblum (Math. Program., 1985)

Ratios of affine functions. - Uriel G. Rothblum (Math. Program., 1985)

A Discrete Time Average Cost Flexible Manufacturing and Operator Scheduling Model Solved by Deconvexification Over Time. - B. Curtis Eaves; Uriel G. Rothblum (Oper. Res., 1988)

A Theory on Extending Algorithms for Parametric Problems. - B. Curtis Eaves; Uriel G. Rothblum (Math. Oper. Res., 1989)

On the Single Resource Capacity Problem for Multi-Item Inventory Systems. - Meir J. Rosenblatt; Uriel G. Rothblum (Oper. Res., 1990)

On Optimal Packing of Randomly Arriving Objects. - Costas Courcoubetis; Uriel G. Rothblum (Math. Oper. Res., 1991)

Characterizations of Max-Balanced Flows. - Uriel G. Rothblum; Hans Schneider; Michael H. Schneider (Discret. Appl. Math., 1992)

Optimal partitions having disjoint convex and conic hulls. - Earl R. Barnes; Alan J. Hoffman; Uriel G. Rothblum (Math. Program., 1992)

Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields. - B. Curtis Eaves; Uriel G. Rothblum (Math. Program., 1992)

Characterization of stable matchings as extreme points of a polytope. - Uriel G. Rothblum (Math. Program., 1992)

Generalization of an engineering principle. - Frank K. Hwang; Uriel G. Rothblum (Oper. Res. Lett., 1992)

Linear Inequality Scaling Problems. - Uriel G. Rothblum (SIAM J. Optim., 1992)

Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs. - Rachelle S. Klein; Hanan Luss; Uriel G. Rothblum (Oper. Res., 1993)

Majorization and Schur Convexity with Respect to Partial Orders. - Frank K. Hwang; Uriel G. Rothblum (Math. Oper. Res., 1993)

Stable Matchings, Optimal Assignments, and Linear Programming. - Alvin E. Roth; Uriel G. Rothblum; John H. Vande Vate (Math. Oper. Res., 1993)

A class of "onto" multifunctions. - B. Curtis Eaves; Uriel G. Rothblum (Math. Program., 1993)

Monotone Optimal Multipartitions Using Schur Convexity with Respect to Partial Orders. - Frank K. Hwang; Uriel G. Rothblum; Larry A. Shepp (SIAM J. Discret. Math., 1993)

Approximations of the Spectral Radius Corresponding Eigenvector, and Second Largest Modulus of an Eigenvalue for Square, Nonnegative, Irreducible Matrices. - Orna Gross; Uriel G. Rothblum (SIAM J. Matrix Anal. Appl., 1993)

Stable Matchings and Linear Inequalities. - Hernán G. Abeledo; Uriel G. Rothblum (Discret. Appl. Math., 1994)

Constrained partitioning problems. - Frank K. Hwang; Uriel G. Rothblum (Discret. Appl. Math., 1994)

Optimality of Monotone Assemblies for Coherent Systems Composed of Series Modules. - Frank K. Hwang; Uriel G. Rothblum (Oper. Res., 1994)

Dynamic Recomputation Cannot Extend the Optimality-Range of Priority Indices. - Uriel G. Rothblum; Michael H. Rothkopf (Oper. Res., 1994)

Formulation of linear problems and solution by a universal machine. - B. Curtis Eaves; Uriel G. Rothblum (Math. Program., 1994)

Relaxation-based algorithms for minimax optimization problems with resource allocation applications. - Rachelle S. Klein; Hanan Luss; Uriel G. Rothblum (Math. Program., 1994)

Scaling Matrices to Prescribed Row and Column Maxima. - Uriel G. Rothblum; Hans Schneider; Michael H. Schneider (SIAM J. Matrix Anal. Appl., 1994)

Paths to Marriage Stability. - Hernán G. Abeledo; Uriel G. Rothblum (Discret. Appl. Math., 1995)

Linear Problems and Linear Algorithms. - B. Curtis Eaves; Uriel G. Rothblum (J. Symb. Comput., 1995)

Assembly at system level versus component level. - Frank K. Hwang; Uriel G. Rothblum (Oper. Res. Lett., 1995)

Approximations to Solutions to Systems of Linear Inequalities. - Osman Güler; Alan J. Hoffman; Uriel G. Rothblum (SIAM J. Matrix Anal. Appl., 1995)

Localizing combinatorial properties of partitions. - Frank K. Hwang; Uriel G. Rothblum; Yi-Ching Yao (Discret. Math., 1996)

Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions. - Frank K. Hwang; Uriel G. Rothblum (Math. Oper. Res., 1996)

Sortabilities of Partition Properties. - 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 (J. Comb. Optim., 1998)

Arithmetic Continuation of Regular Roots of Formal Parametric Polynomial Systems. - B. Curtis Eaves; Uriel G. Rothblum (Comput. Optim. Appl., 1999)

Partition polytopes over 1-dimensional points. - Biao Gao; Frank K. Hwang; Wen-Ching Winnie Li; Uriel G. Rothblum (Math. Program., 1999)

A Polynomial Time Algorithm for Shaped Partition Problems. - Frank K. Hwang; Shmuel Onn; Uriel G. Rothblum (SIAM J. Optim., 1999)

Linear-shaped partition problems. - Frank K. Hwang; Shmuel Onn; Uriel G. Rothblum (Oper. Res. Lett., 2000)

Evaluation, Strength, and Relevance of Variables of Boolean Functions. - Peter L. Hammer; Alexander Kogan; Uriel G. Rothblum (SIAM J. Discret. Math., 2000)

Vertex characterization of partition polytopes of bipartitions and of planar point sets. - Sharon Aviran; Nissan Lev-Tov; Shmuel Onn; Uriel G. Rothblum (Discret. Appl. Math., 2002)

"Timing Is Everything" and Marital Bliss. - Yosef Blum; Uriel G. Rothblum (J. Econ. Theory, 2002)

Sortability of vector partitions. - Frank K. Hwang; J. S. Lee; Yu-Chi Liu; Uriel G. Rothblum (Discret. Math., 2003)

Permutation polytopes corresponding to strongly supermodular functions. - Frank K. Hwang; J. S. Lee; Uriel G. Rothblum (Discret. Appl. Math., 2004)

Convex Combinatorial Optimization. - Shmuel Onn; Uriel G. Rothblum (Discret. Comput. Geom., 2004)

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. - Uriel G. Rothblum (J. Glob. Optim., 2004)

Index Policies for Stochastic Search in a Forest with an Application to R&D Project Management. - Eric V. Denardo; Uriel G. Rothblum; Ludo van der Heyden (Math. Oper. Res., 2004)

The Mean Number-in-System Vector Range for Multiclass Queueing Networks. - B. Curtis Eaves; Peter W. Glynn; Uriel G. Rothblum (Math. Oper. Res., 2004)

Tales of Hoffman. - Uriel G. Rothblum (Oper. Res. Lett., 2004)

Partition-Optimization with Schur Convex Sum Objective Functions. - Frank Kwang-Ming Hwang; Uriel G. Rothblum (SIAM J. Discret. Math., 2004)

Edge-Directions of Standard Polyhedra with Applications to Network Flows. - Shmuel Onn; Uriel G. Rothblum; Yoav Tangir (J. Glob. Optim., 2005)

Nonlinear AIMD Congestion Control and Contraction Mappings. - Uriel G. Rothblum; Robert Shorten (POSTA, 2006)

One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions. - F. H. Chang; H. B. Chen; J. Y. Guo; Frank K. Hwang; Uriel G. Rothblum (J. Comb. Optim., 2006)

The Mean-Partition Problem. - Fei-Hwang Chang; Frank K. Hwang; Uriel G. Rothblum (J. Glob. Optim., 2006)

A Polytope Approach to the Optimal Assembly Problem. - Frank K. Hwang; Uriel G. Rothblum (J. Glob. Optim., 2006)

A Turnpike Theorem For A Risk-Sensitive Markov Decision Process with Stopping. - Eric V. Denardo; Uriel G. Rothblum (SIAM J. Control. Optim., 2006)

The convex dimension of a graph. - Nir Halman; Shmuel Onn; Uriel G. Rothblum (Discret. Appl. Math., 2007)

The use of edge-directions and linear programming to enumerate vertices. - Shmuel Onn; Uriel G. Rothblum (J. Comb. Optim., 2007)

Risk-Sensitive and Risk-Neutral Multiarmed Bandits. - Eric V. Denardo; Haechurl Park; Uriel G. Rothblum (Math. Oper. Res., 2007)

Bounding the inefficiency of Nash equilibria in games with finitely many players. - Uriel G. Rothblum (Oper. Res. Lett., 2007)

On occupation measures for total-reward MDPs. - Eric V. Denardo; Eugene A. Feinberg; Uriel G. Rothblum (CDC, 2008)

Minimum Rank of Matrices Described by a Graph or Pattern over the Rational, Real and Complex Numbers. - Avi Berman; Shmuel Friedland; Leslie Hogben; Uriel G. Rothblum; Bryan L. Shader (Electron. J. Comb., 2008)

Sphere-separable partitions of multi-parameter elements. - Boaz Golany; Frank K. Hwang; Uriel G. Rothblum (Discret. Appl. Math., 2008)

The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. - Irith Ben-Arroyo Hartman; Seffi Naor; Michal Penn; Uriel G. Rothblum (Discret. Appl. Math., 2008)

Editorial. - Irith Ben-Arroyo Hartman; Seffi Naor; Michal Penn; Uriel G. Rothblum (Discret. Appl. Math., 2008)

Equivalence of permutation polytopes corresponding to strictly supermodular functions. - Frank K. Hwang; J. S. Lee; Uriel G. Rothblum (Discret. Appl. Math., 2008)

The partition bargaining problem. - Uriel G. Rothblum; Yoav Tangir (Discret. Appl. Math., 2008)

Stochastic scheduling in an in-forest. - Uriel G. Rothblum; Jay Sethuraman (Discret. Optim., 2008)

A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the technion. - Nitsan Perach; Julia Polak; Uriel G. Rothblum (Int. J. Game Theory, 2008)

Optimal investment in development projects. - Boaz Golany; Uriel G. Rothblum (Oper. Res. Lett., 2008)

Nature plays with dice - terrorists do not: Allocating resources to counter strategic versus probabilistic risks. - Boaz Golany; Edward H. Kaplan; Abraham Marmur; Uriel G. Rothblum (Eur. J. Oper. Res., 2009)

Efficient Solution of a Stochastic Scheduling Problem on an Out-Forest—Revisited. - Uriel G. Rothblum (SIAM J. Optim., 2009)

Incentive compatibility for the stable matching model with an entrance criterion. - Nitsan Perach; Uriel G. Rothblum (Int. J. Game Theory, 2010)

Accuracy Certificates for Computational Problems with Convex Structure. - Arkadi Nemirovski; Shmuel Onn; Uriel G. Rothblum (Math. Oper. Res., 2010)

Determining all Nash equilibria in a (bi-linear) inspection game. - Yael Deutsch; Boaz Golany; Uriel G. Rothblum (Eur. J. Oper. Res., 2011)

On the number of separable partitions. - Frank K. Hwang; Uriel G. Rothblum (J. Comb. Optim., 2011)

A Generalized Two-Agent Location Problem: Asymmetric Dynamics and Coordination. - Boaz Golany; Konstantin Kogan; Uriel G. Rothblum (J. Optim. Theory Appl., 2011)

A Stochastic Competitive R&D Race Where "Winner Takes All". - Pelin G. Canbolat; Boaz Golany; Inbal Mund; Uriel G. Rothblum (Oper. Res., 2012)

Network Optimization Models for Resource Allocation in Developing Military Countermeasures. - Boaz Golany; Moshe Kress; Michal Penn; Uriel G. Rothblum (Oper. Res., 2012)

A new approach to solve open-partition problems. - Huilan Chang; Frank K. Hwang; Uriel G. Rothblum (J. Comb. Optim., 2012)

A Stochastic Competitive Research and Development Race Where "Winner Takes All" with Lower and Upper Bounds. - Pelin G. Canbolat; Boaz Golany; Uriel G. Rothblum (J. Optim. Theory Appl., 2012)

Splitting Randomized Stationary Policies in Total-Reward Markov Decision Processes. - Eugene A. Feinberg; Uriel G. Rothblum (Math. Oper. Res., 2012)

Splitting in a finite Markov decision problem. - Eric V. Denardo; Eugene A. Feinberg; Uriel G. Rothblum (SIGMETRICS Perform. Evaluation Rev., 2012)

The multi-armed bandit, with constraints. - Eric V. Denardo; Eugene A. Feinberg; Uriel G. Rothblum (SIGMETRICS Perform. Evaluation Rev., 2012)

(Approximate) iterated successive approximations algorithm for sequential decision processes. - Pelin G. Canbolat; Uriel G. Rothblum (Ann. Oper. Res., 2013)

An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms. - B. Curtis Eaves; Uriel G. Rothblum (Math. Oper. Res., 2014)

Allocating multiple defensive resources in a zero-sum game setting. - Boaz Golany; Noam Goldberg; Uriel G. Rothblum (Ann. Oper. Res., 2015)

Generating approximate parametric roots of parametric polynomials. - B. Curtis Eaves; Uriel G. Rothblum (Ann. Oper. Res., 2016)

A two-resource allocation algorithm with an application to large-scale zero-sum defensive games. - Boaz Golany; Noam Goldberg; Uriel G. Rothblum (Comput. Oper. Res., 2017)