Uriel G. Rothblum - Citegraph

Author Info

Name	Affiliation	Papers
URIEL G. ROTHBLUM	RUTCOR - Rutgers Center for Operations Research, Rutgers University, P.O. Box 5062, New Brunswick, NJ 08904, USA	84
Collaborators	Citations	PageRank
87	595	125.62
Referers	Referees	References
801	367	370

Search Limit

100801

Publications (84 rows)

Collaborators (87 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
A two-resource allocation algorithm with an application to large-scale zero-sum defensive games.	2	0.50	2017
Generating approximate parametric roots of parametric polynomials	0	0.34	2016
Allocating multiple defensive resources in a zero-sum game setting.	4	0.48	2015
The multi-armed bandit, with constraints	5	0.54	2013
(Approximate) iterated successive approximations algorithm for sequential decision processes.	5	0.58	2013
A new approach to solve open-partition problems	1	0.40	2012
Network Optimization Models for Resource Allocation in Developing Military Countermeasures	5	0.84	2012
A Stochastic Competitive Research and Development Race Where "Winner Takes All" with Lower and Upper Bounds.	0	0.34	2012
Splitting in a finite Markov decision problem	0	0.34	2012
Splitting Randomized Stationary Policies in Total-Reward Markov Decision Processes	2	0.44	2012
A Stochastic Competitive R&D Race Where “Winner Takes All”	4	0.81	2012
On the number of separable partitions	2	0.45	2011
Determining all Nash equilibria in a (bi-linear) inspection game.	8	0.80	2011
A Generalized Two-Agent Location Problem: Asymmetric Dynamics and Coordination	0	0.34	2011
Incentive compatibility for the stable matching model with an entrance criterion	2	0.49	2010
Accuracy Certificates for Computational Problems with Convex Structure	6	0.64	2010
Nature plays with dice - terrorists do not: Allocating resources to counter strategic versus probabilistic risks	31	2.09	2009
Efficient Solution of a Stochastic Scheduling Problem on an Out-Forest—Revisited	0	0.34	2009
The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms	0	0.34	2008
Optimal investment in development projects	4	0.73	2008
Minimum Rank of Matrices Described by a Graph or Pattern over the Rational, Real and Complex Numbers.	2	0.44	2008
The partition bargaining problem	1	0.43	2008
Sphere-separable partitions of multi-parameter elements	1	0.37	2008
Stochastic scheduling in an in-forest	2	0.36	2008
Equivalence of permutation polytopes corresponding to strictly supermodular functions	1	0.43	2008
A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the technion	11	1.36	2008
Nonlinear AIMD Congestion Control and Contraction Mappings	7	0.62	2007
Risk-Sensitive and Risk-Neutral Multiarmed Bandits	10	0.94	2007
The use of edge-directions and linear programming to enumerate vertices	1	0.36	2007
The convex dimension of a graph	8	1.00	2007
Bounding the inefficiency of Nash equilibria in games with finitely many players	0	0.34	2007
A Turnpike Theorem For A Risk-Sensitive Markov Decision Process with Stopping	7	0.81	2006
The Mean-Partition Problem	0	0.34	2006
A Polytope Approach to the Optimal Assembly Problem	0	0.34	2006
One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions	0	0.34	2006
Edge-Directions of Standard Polyhedra with Applications to Network Flows	6	0.55	2005
Tales of Hoffman	1	0.42	2004
The Mean Number-in-System Vector Range for Multiclass Queueing Networks	0	0.34	2004
Partition-Optimization with Schur Convex Sum Objective Functions	2	0.58	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	0	0.34	2004
Index Policies for Stochastic Search in a Forest with an Application to R&D Project Management	8	1.28	2004
Permutation polytopes corresponding to strongly supermodular functions	3	0.49	2004
Convex Combinatorial Optimization	15	2.18	2003
Vertex characterization of partition polytopes of bipartitions and of planar point sets	5	0.79	2002
“Timing Is Everything” and Marital Bliss	7	0.67	2002
Evaluation, Strength, and Relevance of Variables of Boolean Functions	5	1.76	2000
Linear-shaped partition problems	5	0.93	2000
A Polynomial Time Algorithm for Shaped Partition Problems	31	2.90	1999
Arithmetic Continuation of Regular Roots of Formal Parametric Polynomial Systems	0	0.34	1999
Partition polytopes over 1-dimensional points	5	0.98	1999

1
2
50 / page