Arie Tamir

	2009
49		Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir: Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. Algorithmica 55(4): 601-618 (2009)
48		Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir: Minimax Regret Single-Facility Ordered Median Location Problems on Networks. INFORMS Journal on Computing 21(1): 77-87 (2009)
47		Robert Benkoczi, Binay K. Bhattacharya, Arie Tamir: Collection depots facility location problems in trees. Networks 53(1): 50-62 (2009)
46		Olga Gluchshenko, Horst W. Hamacher, Arie Tamir: An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width. Oper. Res. Lett. 37(3): 168-170 (2009)
	2008
45		Justo Puerto, Arie Tamir, Juan A. Mesa, Dionisio Pérez-Brito: Center location problems on tree graphs with subtree-shaped customers. Discrete Applied Mathematics 156(15): 2890-2910 (2008)
44		Pei-Hao Ho, Arie Tamir, Bang Ye Wu: Minimum Lk path partitioning - An illustration of the Monge property. Oper. Res. Lett. 36(1): 43-45 (2008)
	2007
43		Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir: New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks. ESA 2007: 230-240
42		Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir: Efficient algorithms for center problems in cactus networks. Theor. Comput. Sci. 378(3): 237-252 (2007)
	2006
41		Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir: Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. ISAAC 2006: 379-388
40		Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir, Dionisio Pérez-Brito: The bi-criteria doubly weighted center-median path problem on a tree. Networks 47(4): 237-247 (2006)
39		Arie Tamir: Locating two obnoxious facilities using the weighted maximin criterion. Oper. Res. Lett. 34(1): 97-105 (2006)
	2005
38		Arie Tamir, Nir Halman: One-way and round-trip center location problems. Discrete Optimization 2(2): 168-184 (2005)
37		Arie Tamir, Justo Puerto, Juan A. Mesa, Antonio M. Rodríguez-Chía: Conditional location of path and tree shaped facilities on trees. J. Algorithms 56(1): 50-75 (2005)
36		Justo Puerto, Arie Tamir: Locating tree-shaped facilities using the ordered median objective. Math. Program. 102(2): 313-338 (2005)
	2004
35		Nir Halman, Arie Tamir: Continuous bottleneck tree partitioning problems. Discrete Applied Mathematics 140(1-3): 185-206 (2004)
34		Richard L. Francis, Timothy J. Lowe, Arie Tamir, H. Emir-Farinas: A framework for demand point and solution space aggregation analysis for location models. European Journal of Operational Research 159(3): 574-585 (2004)
33		Arie Tamir: An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks. Networks 44(1): 38-40 (2004)
32		Arie Tamir: Sorting weighted distances with applications to objective function evaluations in single facility location problems. Oper. Res. Lett. 32(3): 249-257 (2004)
	2003
31		Juan A. Mesa, Justo Puerto, Arie Tamir: Improved algorithms for several network location problems with equality measures. Discrete Applied Mathematics 130(3): 437-448 (2003)
30		Wlodzimierz Ogryczak, Arie Tamir: Minimizing the sum of the k largest functions in linear time. Inf. Process. Lett. 85(3): 117-122 (2003)
29		Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe: The geometric maximum traveling salesman problem. J. ACM 50(5): 641-664 (2003)
	2002
28		Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe: The Geometric Maximum Traveling Salesman Problem CoRR cs.DS/0204024: (2002)
27		Arie Tamir, Justo Puerto, Dionisio Pérez-Brito: The centdian subtree on tree networks. Discrete Applied Mathematics 118(3): 263-278 (2002)
26		Richard L. Francis, Timothy J. Lowe, Arie Tamir: Worst-case incremental analysis for a class of p-facility location problems. Networks 39(3): 139-143 (2002)
25		Jörg Kalcsics, Stefan Nickel, Justo Puerto, Arie Tamir: Algorithmic results for ordered median problems. Oper. Res. Lett. 30(3): 149-158 (2002)
	2001
24		Arie Tamir: Emanuel Melachrinoudis and Frank GuangSheng Zhang, "An O(mn) algorithm for the 1-maximin problem on a network". Computers and Operations Research 26 (1999) 849-869. Computers & OR 28(2): 189 (2001)
23		Arie Tamir: The k-centrum multi-facility location problem. Discrete Applied Mathematics 109(3): 293-307 (2001)
	2000
22		Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir: Optimal Facility Location Under Various Distance Functions. Int. J. Comput. Geometry Appl. 10(5): 523-534 (2000)
	1999
21		M. Brenda Rayco, Richard L. Francis, Arie Tamir: A p-center grid-positioning aggregation procedure. Computers & OR 26(10-11): 1113-1124 (1999)
	1998
20		Arie Tamir: Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem. Discrete Applied Mathematics 87(1-3): 229-243 (1998)
19		Arie Tamir, Joseph S. B. Mitchell: A maximum b-matching problem arising from median location models with applications to the roommates problem. Math. Program. 80: 171-194 (1998)
18		Arie Tamir, Dionisio Pérez-Brito, José A. Moreno-Pérez: A polynomial algorithm for the p-centdian problem on a tree. Networks 32(4): 255-262 (1998)
	1997
17		Refael Hassin, Shlomi Rubinstein, Arie Tamir: Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21(3): 133-137 (1997)
16		Vernon Ning Hsu, Timothy J. Lowe, Arie Tamir: Structured p-facility location problems on the line solvable in polynomial time. Oper. Res. Lett. 21(4): 159-164 (1997)
	1996
15		Tae Ung Kim, Timothy J. Lowe, Arie Tamir, James E. Ward: On the location of a tree-shaped facility. Networks 28(3): 167-175 (1996)
	1995
14		Refael Hassin, Arie Tamir: On the Minimum Diameter Spanning Tree Problem. Inf. Process. Lett. 53(2): 109-111 (1995)
	1994
13		Arie Tamir: A distance constrained p-facility location problem on the real line. Math. Program. 66: 201-204 (1994)
	1993
12		Y. Kaufman, Arie Tamir: Locating Service Centers with Precedence Constraints. Discrete Applied Mathematics 47(3): 251-261 (1993)
11		Arie Tamir: A Unifying Location Model on Tree Graphs Based on Submodularity Properties. Discrete Applied Mathematics 47(3): 275-283 (1993)
10		Arie Tamir: A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks. Math. Program. 59: 117-132 (1993)
9		Arie Tamir: The least element property of center location on tree networks with applications to distance and precedence constrained problems. Math. Program. 62: 475-496 (1993)
8		Dorit S. Hochbaum, Nimrod Megiddo, Joseph Naor, Arie Tamir: Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Math. Program. 62: 69-83 (1993)
	1991
7		Arie Tamir: On the core of network synthesis games. Math. Program. 50: 123-135 (1991)
6		Arie Tamir: Obnoxious Facility Location on Graphs. SIAM J. Discrete Math. 4(4): 550-567 (1991)
	1990
5		R. Chandrasekaran, Arie Tamir: Algebraic Optimization: The Fermat-Weber Location Problem. Math. Program. 46: 219-224 (1990)
	1988
4		Arie Tamir: Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures. SIAM J. Discrete Math. 1(3): 377-396 (1988)
	1983
3		Nimrod Megiddo, Arie Tamir: New Results on the Complexity of p-Center Problems. SIAM J. Comput. 12(4): 751-758 (1983)
	1981
2		Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran: An O(n log² n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. SIAM J. Comput. 10(2): 328-337 (1981)
	1978
1		Nimrod Megiddo, Arie Tamir: An O(N log N) Algorithm for a Class of Matching Problems. SIAM J. Comput. 7(2): 154-157 (1978)

Coauthor Index

1	Alexander I. Barvinok	[28] [29]
2	Boaz Ben-Moshe	[42]
3	Robert Benkoczi	[47]
4	Sergey Bereg (Sergei Bespamyatnikh)	[22]
5	Binay K. Bhattacharya	[41] [42] [47] [49]
6	Ramaswamy Chandrasekaran (R. Chandrasekaran)	[2] [5]
7	H. Emir-Farinas	[34]
8	Sándor P. Fekete	[28] [29]
9	Richard L. Francis	[21] [26] [34]
10	Olga Gluchshenko	[46]
11	Nir Halman	[35] [38]
12	Horst W. Hamacher	[46]
13	Refael Hassin	[14] [17]
14	Pei-Hao Ho	[44]
15	Dorit S. Hochbaum	[8]
16	Vernon Ning Hsu	[16]
17	Yuzhuang Hu	[41]
18	David S. Johnson	[28] [29]
19	Jörg Kalcsics	[25]
20	Y. Kaufman	[12]
21	Klara Kedem	[22]
22	Tae Ung Kim	[15]
23	Timothy J. Lowe	[15] [16] [26] [34]
24	Nimrod Megiddo	[1] [2] [3] [8]
25	Juan A. Mesa	[31] [37] [45]
26	Joseph S. B. Mitchell	[19]
27	José A. Moreno-Pérez	[18]
28	Joseph Naor (Seffi Naor)	[8]
29	Stefan Nickel	[25]
30	Wlodzimierz Ogryczak	[30]
31	Dionisio Pérez-Brito	[18] [27] [40] [45]
32	Justo Puerto	[25] [27] [31] [36] [37] [40] [43] [45] [48]
33	M. Brenda Rayco	[21]
34	Antonio M. Rodríguez-Chía	[37] [40] [43] [48]
35	Shlomi Rubinstein	[17]
36	Michael Segal	[22]
37	Qiaosheng Shi	[41] [42] [49]
38	James E. Ward	[15]
39	Gerhard J. Woeginger	[28] [29]
40	Russell Woodroofe	[28] [29]
41	Bang Ye Wu	[44]
42	Eitan Zemel	[2]

Colors in the list of coauthors