On "an efficient algorithm for minimizing barrier and penalty functions". - Arie Tamir (Math. Program., 1972)

On a characterization of P-matrices. - Arie Tamir (Math. Program., 1973)

Minimality and complementarity properties associated with Z-functions and M-functions. - Arie Tamir (Math. Program., 1974)

On the number of solutions to the linear comple-mentarity problem. - Arie Tamir (Math. Program., 1976)

Ergodicity and symmetric mathematical programs. - Arie Tamir (Math. Program., 1977)

An O(N log N) Algorithm for a Class of Matching Problems. - Nimrod Megiddo; Arie Tamir (SIAM J. Comput., 1978)

The use of jacobi's lemma in unimodularity theory. - Moshe Kress; Arie Tamir (Math. Program., 1980)

An O ((nlog p)2) Algorithm for the Continuous p-Center Problem on a Tree. - Ramaswamy Chandrasekaran; Arie Tamir (SIAM J. Algebraic Discret. Methods, 1980)

An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. - Nimrod Megiddo; Arie Tamir; Eitan Zemel; R. Chandrasekaran (SIAM J. Comput., 1981)

On the solution of discrete bottleneck problems. - Arie Tamir (Discret. Appl. Math., 1982)

Locating Centers on a Tree with Discontinuous Supply and Demand Regions. - Arie Tamir; Eitan Zemel (Math. Oper. Res., 1982)

Polynomially bounded algorithms for locating p-centers on a tree. - R. Chandrasekaran; Arie Tamir (Math. Program., 1982)

On the complexity of locating linear facilities in the plane. - Nimrod Megiddo; Arie Tamir (Oper. Res. Lett., 1982)

New Results on the Complexity of p-Center Problems. - Nimrod Megiddo; Arie Tamir (SIAM J. Comput., 1983)

Polynomial testing of the query "IS ab ≥ cd?" with application to finding a minimal cost reliability ratio spanning tree. - Ramaswamy Chandrasekaran; Arie Tamir (Discret. Appl. Math., 1984)

Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games. - R. Chandrasekaran; Arie Tamir (Math. Program., 1984)

Minimum cost flow algorithms for series-parallel networks. - Wolfgang W. Bein; Peter Brucker; Arie Tamir (Discret. Appl. Math., 1985)

A finite algorithm for the continuousp-center location problem on a graph. - Arie Tamir (Math. Program., 1985)

Totally balanced and totally unimodular matrices defined by center location problems. - Arie Tamir (Discret. Appl. Math., 1987)

On the Solution Value of the Continuous p-Center Location Problem on a Graph. - Arie Tamir (Math. Oper. Res., 1987)

The minimax multistop location problem on a tree. - Oded Berman; David Simchi-Levi; Arie Tamir (Networks, 1988)

Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures. - Arie Tamir (SIAM J. Discret. Math., 1988)

Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems. - Erhan Erkut; Richard L. Francis; Timothy J. Lowe; Arie Tamir (Oper. Res., 1989)

Maximizing Classes of Two-Parameter Objectives Over Matroids. - Refael Hassin; Arie Tamir (Math. Oper. Res., 1989)

Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem. - Ramaswamy Chandrasekaran; Arie Tamir (Math. Program., 1989)

Algebraic Optimization: The Fermat-Weber Location Problem. - R. Chandrasekaran; Arie Tamir (Math. Program., 1990)

On the core of network synthesis games. - Arie Tamir (Math. Program., 1991)

Improved complexity bounds for location problems on the real line. - Refael Hassin; Arie Tamir (Oper. Res. Lett., 1991)

Obnoxious Facility Location on Graphs. - Arie Tamir (SIAM J. Discret. Math., 1991)

Distance-constrained multifacility minimax location problems on tree networks. - Erhan Erkut; Richard L. Francis; Arie Tamir (Networks, 1992)

On a tree-shaped facility location problem of Minieka. - Ramon Rabinovitch; Arie Tamir (Networks, 1992)

The generalized P-forest problem on a tree network. - Arie Tamir; Timothy J. Lowe (Networks, 1992)

Technical Note - On the Complexity of Some Classes of Location Problems. - Arie Tamir (Transp. Sci., 1992)

Locating Service Centers with Precedence Constraints. - Y. Kaufman; Arie Tamir (Discret. Appl. Math., 1993)

A Unifying Location Model on Tree Graphs Based on Submodularity Properties. - Arie Tamir (Discret. Appl. Math., 1993)

Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. - Dorit S. Hochbaum; Nimrod Megiddo; Joseph Naor; Arie Tamir (Math. Program., 1993)

A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks. - Arie Tamir (Math. Program., 1993)

The least element property of center location on tree networks with applications to distance and precedence constrained problems. - Arie Tamir (Math. Program., 1993)

Linear time algorithms for some separable quadratic programming problems. - Nimrod Megiddo; Arie Tamir (Oper. Res. Lett., 1993)

Complexity results for the p-median problem with mutual communication. - Arie Tamir (Oper. Res. Lett., 1993)

On the Core of Cost Allocation Games Defined on Location Problems. - Arie Tamir (Transp. Sci., 1993)

A distance constrained p-facility location problem on the real line. - Arie Tamir (Math. Program., 1994)

On the Minimum Diameter Spanning Tree Problem. - Refael Hassin; Arie Tamir (Inf. Process. Lett., 1995)

Least Majorized Elements and Generalized Polymatroids. - Arie Tamir (Math. Oper. Res., 1995)

On the location of a tree-shaped facility. - Tae Ung Kim; Timothy J. Lowe; Arie Tamir; James E. Ward (Networks, 1996)

An O(pn2) algorithm for the p-median and related problems on tree graphs. - Arie Tamir (Oper. Res. Lett., 1996)

Capacitated Location Problems on a Line. - Prakash Mirchandani; Rajeev Kohli; Arie Tamir (Transp. Sci., 1996)

Approximation algorithms for maximum dispersion. - Refael Hassin; Shlomi Rubinstein; Arie Tamir (Oper. Res. Lett., 1997)

Structured p-facility location problems on the line solvable in polynomial time. - Vernon Ning Hsu; Timothy J. Lowe; Arie Tamir (Oper. Res. Lett., 1997)

Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem. - Arie Tamir (Discret. Appl. Math., 1998)

A maximum b-matching problem arising from median location models with applications to the roommates problem. - Arie Tamir; Joseph S. B. Mitchell (Math. Program., 1998)

A polynomial algorithm for the p-centdian problem on a tree. - Arie Tamir; Dionisio Pérez-Brito; José A. Moreno-Pérez (Networks, 1998)

A p-center grid-positioning aggregation procedure. - M. Brenda Rayco; Richard L. Francis; Arie Tamir (Comput. Oper. Res., 1999)

Optimal Facility Location Under Various Distance Functions. - Sergei Bespamyatnikh; Klara Kedem; Michael Segal 001; Arie Tamir (Int. J. Comput. Geom. Appl., 2000)

Aggregation Error Bounds for a Class of Location Models. - Richard L. Francis; Timothy J. Lowe; Arie Tamir (Oper. Res., 2000)

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. - Arie Tamir (Comput. Oper. Res., 2001)

The k-centrum multi-facility location problem. - Arie Tamir (Discret. Appl. Math., 2001)

The centdian subtree on tree networks. - Arie Tamir; Justo Puerto; Dionisio Pérez-Brito (Discret. Appl. Math., 2002)

Worst-case incremental analysis for a class of p-facility location problems. - Richard L. Francis; Timothy J. Lowe; Arie Tamir (Networks, 2002)

Algorithmic results for ordered median problems. - Jörg Kalcsics; Stefan Nickel; Justo Puerto; Arie Tamir (Oper. Res. Lett., 2002)

Improved algorithms for several network location problems with equality measures. - Juan A. Mesa; Justo Puerto; Arie Tamir (Discret. Appl. Math., 2003)

Minimizing the sum of the k largest functions in linear time. - Wlodzimierz Ogryczak; Arie Tamir (Inf. Process. Lett., 2003)

The geometric maximum traveling salesman problem. - Alexander I. Barvinok; Sándor P. Fekete; David S. Johnson 001; Arie Tamir; Gerhard J. Woeginger; Russell Woodroofe (J. ACM, 2003)

Continuous bottleneck tree partitioning problems. - Nir Halman; Arie Tamir (Discret. Appl. Math., 2004)

A framework for demand point and solution space aggregation analysis for location models. - Richard L. Francis; Timothy J. Lowe; Arie Tamir; Hülya Emir-Farinas (Eur. J. Oper. Res., 2004)

An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks. - Arie Tamir (Networks, 2004)

Sorting weighted distances with applications to objective function evaluations in single facility location problems. - Arie Tamir (Oper. Res. Lett., 2004)

One-way and round-trip center location problems. - Arie Tamir; Nir Halman (Discret. Optim., 2005)

Conditional location of path and tree shaped facilities on trees. - Arie Tamir; Justo Puerto; Juan A. Mesa; Antonio M. Rodríguez-Chía (J. Algorithms, 2005)

Locating tree-shaped facilities using the ordered median objective. - Justo Puerto; Arie Tamir (Math. Program., 2005)

Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. - Binay K. Bhattacharya; Yuzhuang Hu; Qiaosheng Shi; Arie Tamir (ISAAC, 2006)

The bi-criteria doubly weighted center-median path problem on a tree. - Justo Puerto; Antonio M. Rodríguez-Chía; Arie Tamir; Dionisio Pérez-Brito (Networks, 2006)

Locating two obnoxious facilities using the weighted maximin criterion. - Arie Tamir (Oper. Res. Lett., 2006)

New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks. - Justo Puerto; Antonio M. Rodríguez-Chía; Arie Tamir (ESA, 2007)

Efficient algorithms for center problems in cactus networks. - Boaz Ben-Moshe; Binay K. Bhattacharya; Qiaosheng Shi; Arie Tamir (Theor. Comput. Sci., 2007)

Center location problems on tree graphs with subtree-shaped customers. - Justo Puerto; Arie Tamir; Juan A. Mesa; Dionisio Pérez-Brito (Discret. Appl. Math., 2008)

Minimum Lk path partitioning - An illustration of the Monge property. - Pei-Hao Ho; Arie Tamir; Bang Ye Wu (Oper. Res. Lett., 2008)

Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. - Binay K. Bhattacharya; Qiaosheng Shi; Arie Tamir (Algorithmica, 2009)

Optimal location with equitable loads. - Oded Berman; Zvi Drezner; Arie Tamir; George O. Wesolowsky (Ann. Oper. Res., 2009)

Aggregation error for location models: survey and analysis. - Richard L. Francis; Timothy J. Lowe; M. Brenda Rayco; Arie Tamir (Ann. Oper. Res., 2009)

Minimax Regret Single-Facility Ordered Median Location Problems on Networks. - Justo Puerto; Antonio M. Rodríguez-Chía; Arie Tamir (INFORMS J. Comput., 2009)

Collection depots facility location problems in trees. - Robert Benkoczi; Binay K. Bhattacharya; Arie Tamir (Networks, 2009)

Minimax flow tree problems. - Hui Chen; Ann Melissa Campbell; Barrett W. Thomas; Arie Tamir (Networks, 2009)

Combinatorial fiber-tracking of the human brain. - Shlomi Lifshits; Arie Tamir; Yaniv Assaf (NeuroImage, 2009)

An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width. - Olga Gluchshenko; Horst W. Hamacher; Arie Tamir (Oper. Res. Lett., 2009)

New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems. - Arie Tamir (Oper. Res. Lett., 2009)

Some new cooperative coverage facility location games. - Justo Puerto; Arie Tamir; Federico Perea (BQGT, 2010)

Centdian Computation for Sensor Networks. - Boaz Ben-Moshe; Amit Dvir; Michael Segal 001; Arie Tamir (TAMC, 2010)

On the Planar Piecewise Quadratic 1-Center Problem. - Justo Puerto; Antonio M. Rodríguez-Chía; Arie Tamir (Algorithmica, 2010)

A cooperative location game based on the 1-center location problem. - Justo Puerto; Arie Tamir; Federico Perea (Eur. J. Oper. Res., 2011)

Cooperative location games based on the minimum diameter spanning Steiner subgraph problem. - Justo Puerto; Arie Tamir; Federico Perea (Discret. Appl. Math., 2012)

Centdian Computation in Cactus Graphs. - Boaz Ben-Moshe; Amit Dvir; Michael Segal 001; Arie Tamir (J. Graph Algorithms Appl., 2012)

Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs. - Avivit Lazar; Arie Tamir (Algorithmica, 2013)

An overview of ORP3-OR for young researchers and practitioners. - Justo Puerto; Antonio M. Rodríguez-Chía; Arie Tamir (Ann. Oper. Res., 2014)

Revisiting k-sum optimization. - Justo Puerto; Antonio M. Rodríguez-Chía; Arie Tamir (Math. Program., 2017)

The nestedness property of the convex ordered median location problem on a tree. - Mark Rozanov; Arie Tamir (Discret. Optim., 2020)

Extensions to the Weber problem. - Richard L. Church; Zvi Drezner; Arie Tamir (Comput. Oper. Res., 2022)

Reviewing extensions and solution methods of the planar Weber single facility location problem. - Richard L. Church; Zvi Drezner; Frank Plastria; Arie Tamir (Comput. Oper. Res., 2025)