Arie Tamir

Publication Activity (10 Years)

Years Active: 1972-2022
Publications (10 Years): 3

Top Topics

Risk Minimization

Researchers And Practitioners

Multi Disciplinary

Top Venues

Ann. Oper. Res.

Discret. Optim.

Comput. Oper. Res.

Publications

Richard L. Church, Zvi Drezner, Arie Tamir
Extensions to the Weber problem. Comput. Oper. Res. 143 (2022)
Mark Rozanov, Arie Tamir
The nestedness property of the convex ordered median location problem on a tree. Discret. Optim. 36 (2020)
Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir
Revisiting k-sum optimization. Math. Program. 165 (2) (2017)
Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir
-OR for young researchers and practitioners. Ann. Oper. Res. 222 (1) (2014)
Avivit Lazar, Arie Tamir
Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs. Algorithmica 66 (3) (2013)
Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir
Centdian Computation in Cactus Graphs. J. Graph Algorithms Appl. 16 (2) (2012)
Justo Puerto, Arie Tamir, Federico Perea
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem. Discret. Appl. Math. 160 (7-8) (2012)
Justo Puerto, Arie Tamir, Federico Perea
A cooperative location game based on the 1-center location problem. Eur. J. Oper. Res. 214 (2) (2011)
Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir
On the Planar Piecewise Quadratic 1-Center Problem. Algorithmica 57 (2) (2010)
Justo Puerto, Arie Tamir, Federico Perea
Some new cooperative coverage facility location games. BQGT (2010)
Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir
Centdian Computation for Sensor Networks. TAMC (2010)
Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir
Minimax Regret Single-Facility Ordered Median Location Problems on Networks. INFORMS J. Comput. 21 (1) (2009)
Shlomi Lifshits, Arie Tamir, Yaniv Assaf
Combinatorial fiber-tracking of the human brain. NeuroImage 48 (3) (2009)
Arie Tamir
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems. Oper. Res. Lett. 37 (5) (2009)
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) (2009)
Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir
Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. Algorithmica 55 (4) (2009)
Robert Benkoczi, Binay K. Bhattacharya, Arie Tamir
Collection depots facility location problems in trees. Networks 53 (1) (2009)
Richard L. Francis, Timothy J. Lowe, M. Brenda Rayco, Arie Tamir
Aggregation error for location models: survey and analysis. Ann. Oper. Res. 167 (1) (2009)
Oded Berman, Zvi Drezner, Arie Tamir, George O. Wesolowsky
Optimal location with equitable loads. Ann. Oper. Res. 167 (1) (2009)
Hui Chen, Ann Melissa Campbell, Barrett W. Thomas, Arie Tamir
Minimax flow tree problems. Networks 54 (3) (2009)
Justo Puerto, Arie Tamir, Juan A. Mesa, Dionisio Pérez-Brito
Center location problems on tree graphs with subtree-shaped customers. Discret. Appl. Math. 156 (15) (2008)
Pei-Hao Ho, Arie Tamir, Bang Ye Wu
path partitioning - An illustration of the Monge property. Oper. Res. Lett. 36 (1) (2008)
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)
Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir
Efficient algorithms for center problems in cactus networks. Theor. Comput. Sci. 378 (3) (2007)
Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir
Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. ISAAC (2006)
Arie Tamir
Locating two obnoxious facilities using the weighted maximin criterion. Oper. Res. Lett. 34 (1) (2006)
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) (2006)
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) (2005)
Justo Puerto, Arie Tamir
Locating tree-shaped facilities using the ordered median objective. Math. Program. 102 (2) (2005)
Arie Tamir, Nir Halman
One-way and round-trip center location problems. Discret. Optim. 2 (2) (2005)
Arie Tamir
An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks. Networks 44 (1) (2004)
Arie Tamir
Sorting weighted distances with applications to objective function evaluations in single facility location problems. Oper. Res. Lett. 32 (3) (2004)
Nir Halman, Arie Tamir
Continuous bottleneck tree partitioning problems. Discret. Appl. Math. 140 (1-3) (2004)
Richard L. Francis, Timothy J. Lowe, Arie Tamir, Hülya Emir-Farinas
A framework for demand point and solution space aggregation analysis for location models. Eur. J. Oper. Res. 159 (3) (2004)
Juan A. Mesa, Justo Puerto, Arie Tamir
Improved algorithms for several network location problems with equality measures. Discret. Appl. Math. 130 (3) (2003)
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) (2003)
Wlodzimierz Ogryczak, Arie Tamir
Minimizing the sum of the k largest functions in linear time. Inf. Process. Lett. 85 (3) (2003)
Richard L. Francis, Timothy J. Lowe, Arie Tamir
Worst-case incremental analysis for a class of p-facility location problems. Networks 39 (3) (2002)
Jörg Kalcsics, Stefan Nickel, Justo Puerto, Arie Tamir
Algorithmic results for ordered median problems. Oper. Res. Lett. 30 (3) (2002)
Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
The Geometric Maximum Traveling Salesman Problem CoRR (2002)
Arie Tamir, Justo Puerto, Dionisio Pérez-Brito
The centdian subtree on tree networks. Discret. Appl. Math. 118 (3) (2002)
Arie Tamir
) algorithm for the 1-maximin problem on a network". Computers and Operations Research 26 (1999) 849-869. Comput. Oper. Res. 28 (2) (2001)
Arie Tamir
The k-centrum multi-facility location problem. Discret. Appl. Math. 109 (3) (2001)
Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir
Optimal Facility Location Under Various Distance Functions. Int. J. Comput. Geom. Appl. 10 (5) (2000)
Richard L. Francis, Timothy J. Lowe, Arie Tamir
Aggregation Error Bounds for a Class of Location Models. Oper. Res. 48 (2) (2000)
M. Brenda Rayco, Richard L. Francis, Arie Tamir
-center grid-positioning aggregation procedure. Comput. Oper. Res. 26 (10-11) (1999)
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) (1998)
Arie Tamir
Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem. Discret. Appl. Math. 87 (1-3) (1998)
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 (1998)
Refael Hassin, Shlomi Rubinstein, Arie Tamir
Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21 (3) (1997)
Vernon Ning Hsu, Timothy J. Lowe, Arie Tamir
-facility location problems on the line solvable in polynomial time. Oper. Res. Lett. 21 (4) (1997)
Arie Tamir
) algorithm for the p-median and related problems on tree graphs. Oper. Res. Lett. 19 (2) (1996)
Tae Ung Kim, Timothy J. Lowe, Arie Tamir, James E. Ward
On the location of a tree-shaped facility. Networks 28 (3) (1996)
Prakash Mirchandani, Rajeev Kohli, Arie Tamir
Capacitated Location Problems on a Line. Transp. Sci. 30 (1) (1996)
Refael Hassin, Arie Tamir
On the Minimum Diameter Spanning Tree Problem. Inf. Process. Lett. 53 (2) (1995)
Arie Tamir
Least Majorized Elements and Generalized Polymatroids. Math. Oper. Res. 20 (3) (1995)
Arie Tamir
A distance constrained p-facility location problem on the real line. Math. Program. 66 (1994)
Nimrod Megiddo, Arie Tamir
Linear time algorithms for some separable quadratic programming problems. Oper. Res. Lett. 13 (4) (1993)
Arie Tamir
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks. Math. Program. 59 (1993)
Arie Tamir
A Unifying Location Model on Tree Graphs Based on Submodularity Properties. Discret. Appl. Math. 47 (3) (1993)
Y. Kaufman, Arie Tamir
Locating Service Centers with Precedence Constraints. Discret. Appl. Math. 47 (3) (1993)
Arie Tamir
The least element property of center location on tree networks with applications to distance and precedence constrained problems. Math. Program. 62 (1993)
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 (1993)
Arie Tamir
On the Core of Cost Allocation Games Defined on Location Problems. Transp. Sci. 27 (1) (1993)
Arie Tamir
Complexity results for the p-median problem with mutual communication. Oper. Res. Lett. 14 (2) (1993)
Arie Tamir, Timothy J. Lowe
-forest problem on a tree network. Networks 22 (3) (1992)
Erhan Erkut, Richard L. Francis, Arie Tamir
Distance-constrained multifacility minimax location problems on tree networks. Networks 22 (1) (1992)
Ramon Rabinovitch, Arie Tamir
On a tree-shaped facility location problem of Minieka. Networks 22 (6) (1992)
Arie Tamir
Technical Note - On the Complexity of Some Classes of Location Problems. Transp. Sci. 26 (4) (1992)
Refael Hassin, Arie Tamir
Improved complexity bounds for location problems on the real line. Oper. Res. Lett. 10 (7) (1991)
Arie Tamir
Obnoxious Facility Location on Graphs. SIAM J. Discret. Math. 4 (4) (1991)
Arie Tamir
On the core of network synthesis games. Math. Program. 50 (1991)
R. Chandrasekaran, Arie Tamir
Algebraic Optimization: The Fermat-Weber Location Problem. Math. Program. 46 (1990)
Refael Hassin, Arie Tamir
Maximizing Classes of Two-Parameter Objectives Over Matroids. Math. Oper. Res. 14 (2) (1989)
Ramaswamy Chandrasekaran, Arie Tamir
Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem. Math. Program. 44 (1-3) (1989)
Erhan Erkut, Richard L. Francis, Timothy J. Lowe, Arie Tamir
Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems. Oper. Res. 37 (3) (1989)
Oded Berman, David Simchi-Levi, Arie Tamir
The minimax multistop location problem on a tree. Networks 18 (1) (1988)
Arie Tamir
Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures. SIAM J. Discret. Math. 1 (3) (1988)
Arie Tamir
-Center Location Problem on a Graph. Math. Oper. Res. 12 (2) (1987)
Arie Tamir
Totally balanced and totally unimodular matrices defined by center location problems. Discret. Appl. Math. 16 (3) (1987)
Arie Tamir
-center location problem on a graph. Math. Program. 31 (3) (1985)
Wolfgang W. Bein, Peter Brucker, Arie Tamir
Minimum cost flow algorithms for series-parallel networks. Discret. Appl. Math. 10 (2) (1985)
Ramaswamy Chandrasekaran, Arie Tamir
?" with application to finding a minimal cost reliability ratio spanning tree. Discret. Appl. Math. 9 (2) (1984)
R. Chandrasekaran, Arie Tamir
Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games. Math. Program. 30 (3) (1984)
Nimrod Megiddo, Arie Tamir
New Results on the Complexity of p-Center Problems. SIAM J. Comput. 12 (4) (1983)
Nimrod Megiddo, Arie Tamir
On the complexity of locating linear facilities in the plane. Oper. Res. Lett. 1 (5) (1982)
Arie Tamir
On the solution of discrete bottleneck problems. Discret. Appl. Math. 4 (4) (1982)
R. Chandrasekaran, Arie Tamir
-centers on a tree. Math. Program. 22 (1) (1982)
Arie Tamir, Eitan Zemel
Locating Centers on a Tree with Discontinuous Supply and Demand Regions. Math. Oper. Res. 7 (2) (1982)
Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran
n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. SIAM J. Comput. 10 (2) (1981)
Moshe Kress, Arie Tamir
The use of jacobi's lemma in unimodularity theory. Math. Program. 18 (1) (1980)
Ramaswamy Chandrasekaran, Arie Tamir
) Algorithm for the Continuous p-Center Problem on a Tree. SIAM J. Algebraic Discret. Methods 1 (4) (1980)
Nimrod Megiddo, Arie Tamir
An O(N log N) Algorithm for a Class of Matching Problems. SIAM J. Comput. 7 (2) (1978)
Arie Tamir
Ergodicity and symmetric mathematical programs. Math. Program. 13 (1) (1977)
Arie Tamir
On the number of solutions to the linear comple-mentarity problem. Math. Program. 10 (1) (1976)
Arie Tamir
Minimality and complementarity properties associated with Z-functions and M-functions. Math. Program. 7 (1) (1974)
Arie Tamir
On a characterization of P-matrices. Math. Program. 4 (1) (1973)
Arie Tamir
On "an efficient algorithm for minimizing barrier and penalty functions". Math. Program. 3 (1) (1972)