Follow
Arie Tamir
Arie Tamir
Emeritus Professor of Operations Research, Tel Aviv University
Verified email at tauex.tau.ac.il
Title
Cited by
Cited by
Year
An O (pn2) algorithm for the p-median and related problems on tree graphs
A Tamir
Operations research letters 19 (2), 59-64, 1996
3341996
On the complexity of locating linear facilities in the plane
N Megiddo, A Tamir
Operations research letters 1 (5), 194-197, 1982
2591982
Approximation algorithms for maximum dispersion
R Hassin, S Rubinstein, A Tamir
Operations research letters 21 (3), 133-137, 1997
2241997
Obnoxious facility location on graphs
A Tamir
SIAM Journal on Discrete Mathematics 4 (4), 550-567, 1991
2031991
Minimizing the sum of the k largest functions in linear time
W Ogryczak, A Tamir
Information Processing Letters 85 (3), 117-122, 2003
2002003
Improved complexity bounds for location problems on the real line.
R Hassin, A Tamir
Operations Research Letters 10 (7), 395-402, 1991
1831991
An Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
N Megiddo, A Tamir, E Zemel, R Chandrasekaran
SIAM Journal on Computing 10 (2), 328-337, 1981
1811981
New Results on the Complexity of p-Centre Problems
N Megiddo, A Tamir
SIAM Journal on Computing 12 (4), 751-758, 1983
1731983
On the minimum diameter spanning tree problem
R Hassin, A Tamir
Information processing letters 53 (2), 109-111, 1995
1671995
Aggregation error for location models: survey and analysis
RL Francis, TJ Lowe, MB Rayco, A Tamir
Annals of Operations Research 167, 171-208, 2009
1472009
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
DS Hochbaum, N Megiddo, J Naor, A Tamir
Mathematical programming 62 (1), 69-83, 1993
1411993
Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
R Chandrasekaran, A Tamir
Mathematical Programming 44, 293-295, 1989
1401989
Covering problems
A Kolen, A Tamir
Discrete location theory 1995, 263-304, 1990
1381990
Algebraic optimization: the Fermat-Weber location problem
R Chandrasekaran, A Tamir
Mathematical Programming 46, 219-224, 1990
1241990
The k-centrum multi-facility location problem
A Tamir
Discrete Applied Mathematics 109 (3), 293-307, 2001
1182001
Improved complexity bounds for center location problems on networks by using dynamic data structures
A Tamir
SIAM Journal on Discrete Mathematics 1 (3), 377-396, 1988
1101988
On the core of network synthesis games
A Tamir
Mathematical Programming 50, 123-135, 1991
1041991
On the core of a traveling salesman cost allocation game
A Tamir
Operations Research Letters 8 (1), 31-34, 1989
1001989
Algorithmic results for ordered median problems
J Kalcsics, S Nickel, J Puerto, A Tamir
Operations Research Letters 30 (3), 149-158, 2002
952002
Aggregation error bounds for a class of location models
RL Francis, TJ Lowe, A Tamir
Operations research 48 (2), 294-307, 2000
952000
The system can't perform the operation now. Try again later.
Articles 1–20