2009 |
37 | EE | Boaz Golany,
Edward H. Kaplan,
Abraham Marmur,
Uriel G. Rothblum:
Nature plays with dice - terrorists do not: Allocating resources to counter strategic versus probabilistic risks.
European Journal of Operational Research 192(1): 198-208 (2009) |
2008 |
36 | EE | Frank K. Hwang,
J. S. Lee,
Uriel G. Rothblum:
Equivalence of permutation polytopes corresponding to strictly supermodular functions.
Discrete Applied Mathematics 156(12): 2336-2343 (2008) |
35 | EE | Irith Ben-Arroyo Hartman,
Seffi Naor,
Michal Penn,
Uriel G. Rothblum:
The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms.
Discrete Applied Mathematics 156(4): 407-408 (2008) |
34 | EE | Irith Ben-Arroyo Hartman,
Seffi Naor,
Michal Penn,
Uriel G. Rothblum:
Editorial.
Discrete Applied Mathematics 156(4): 410-411 (2008) |
33 | EE | Uriel G. Rothblum,
Yoav Tangir:
The partition bargaining problem.
Discrete Applied Mathematics 156(4): 428-443 (2008) |
32 | EE | Boaz Golany,
Frank K. Hwang,
Uriel G. Rothblum:
Sphere-separable partitions of multi-parameter elements.
Discrete Applied Mathematics 156(6): 838-845 (2008) |
31 | EE | Uriel G. Rothblum,
Jay Sethuraman:
Stochastic scheduling in an in-forest.
Discrete Optimization 5(2): 457-466 (2008) |
30 | EE | Boaz Golany,
Uriel G. Rothblum:
Optimal investment in development projects.
Oper. Res. Lett. 36(6): 657-661 (2008) |
2007 |
29 | EE | Nir Halman,
Shmuel Onn,
Uriel G. Rothblum:
The convex dimension of a graph.
Discrete Applied Mathematics 155(11): 1373-1383 (2007) |
28 | EE | Shmuel Onn,
Uriel G. Rothblum:
The use of edge-directions and linear programming to enumerate vertices.
J. Comb. Optim. 14(2-3): 153-164 (2007) |
27 | EE | Uriel G. Rothblum:
Bounding the inefficiency of Nash equilibria in games with finitely many players.
Oper. Res. Lett. 35(6): 700-706 (2007) |
2006 |
26 | EE | 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) |
2004 |
25 | EE | Shmuel Onn,
Uriel G. Rothblum:
Convex Combinatorial Optimization.
Discrete & Computational Geometry 32(4): 549-566 (2004) |
24 | EE | Frank K. Hwang,
J. S. Lee,
Uriel G. Rothblum:
Permutation polytopes corresponding to strongly supermodular functions.
Discrete Applied Mathematics 142(1-3): 87-97 (2004) |
23 | EE | 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) |
22 | EE | 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) |
21 | EE | Uriel G. Rothblum:
Tales of Hoffman.
Oper. Res. Lett. 32(6): 591-594 (2004) |
20 | EE | Frank Kwang-Ming Hwang,
Uriel G. Rothblum:
Partition-Optimization with Schur Convex Sum Objective Functions.
SIAM J. Discrete Math. 18(3): 512-524 (2004) |
2003 |
19 | EE | Shmuel Onn,
Uriel G. Rothblum:
Convex Combinatorial Optimization
CoRR math.CO/0309083: (2003) |
18 | EE | Frank K. Hwang,
J. S. Lee,
Y. C. Liu,
Uriel G. Rothblum:
Sortability of vector partitions.
Discrete Mathematics 263(1-3): 129-142 (2003) |
2002 |
17 | | Sharon Aviran,
Nissan Lev-Tov,
Shmuel Onn,
Uriel G. Rothblum:
Vertex characterization of partition polytopes of bipartitions and of planar point sets.
Discrete Applied Mathematics 124(1-3): 1-15 (2002) |
2000 |
16 | EE | Frank K. Hwang,
Shmuel Onn,
Uriel G. Rothblum:
Linear-shaped partition problems.
Oper. Res. Lett. 26(4): 159-163 (2000) |
15 | EE | Peter L. Hammer,
Alexander Kogan,
Uriel G. Rothblum:
Evaluation, Strength, and Relevance of Variables of Boolean Functions.
SIAM J. Discrete Math. 13(3): 302-312 (2000) |
1998 |
14 | | 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 |
13 | EE | Frank K. Hwang,
Uriel G. Rothblum,
Yi-Ching Yao:
Localizing combinatorial properties of partitions.
Discrete Mathematics 160(1-3): 1-23 (1996) |
1995 |
12 | EE | Hernán G. Abeledo,
Uriel G. Rothblum:
Paths to Marriage Stability.
Discrete Applied Mathematics 63(1): 1-12 (1995) |
11 | | B. Curtis Eaves,
Uriel G. Rothblum:
Linear Problems and Linear Algorithms.
J. Symb. Comput. 20(2): 207-214 (1995) |
1994 |
10 | | Frank K. Hwang,
Uriel G. Rothblum:
Constrained partitioning problems.
Discrete Applied Mathematics 50(1): 93-96 (1994) |
9 | EE | Hernán G. Abeledo,
Uriel G. Rothblum:
Stable Matchings and Linear Inequalities.
Discrete Applied Mathematics 54(1): 1-27 (1994) |
8 | | 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) |
7 | | B. Curtis Eaves,
Uriel G. Rothblum:
Formulation of linear problems and solution by a universal machine.
Math. Program. 65: 263-309 (1994) |
1993 |
6 | | B. Curtis Eaves,
Uriel G. Rothblum:
A class of "onto" multifunctions.
Math. Program. 61: 327-343 (1993) |
5 | | Frank K. Hwang,
Uriel G. Rothblum,
Larry A. Shepp:
Monotone Optimal Multipartitions Using Schur Convexity with Respect to Partial Orders.
SIAM J. Discrete Math. 6(4): 533-547 (1993) |
1992 |
4 | EE | Uriel G. Rothblum,
Hans Schneider,
Michael H. Schneider:
Characterizations of Max-Balanced Flows.
Discrete Applied Mathematics 39(3): 241-261 (1992) |
3 | | 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) |
2 | | Uriel G. Rothblum:
Characterization of stable matchings as extreme points of a polytope.
Math. Program. 54: 57-67 (1992) |
1 | | E. R. Barnes,
Alan J. Hoffman,
Uriel G. Rothblum:
Optimal partitions having disjoint convex and conic hulls.
Math. Program. 54: 69-86 (1992) |