Arie Tamir - RankMe

99 papers A 1B 1C 1Journal 95Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Reviewing extensions and solution methods of the planar Weber single facility location problem. Comput. Oper. Res. Richard L. Church, Zvi Drezner, Frank Plastria, Arie Tamir
2022	J	`jnl`	Extensions to the Weber problem. Comput. Oper. Res. Richard L. Church, Zvi Drezner, Arie Tamir
2020	J	`jnl`	The nestedness property of the convex ordered median location problem on a tree. Discret. Optim. Mark Rozanov, Arie Tamir
2017	J	`jnl`	Revisiting k-sum optimization. Math. Program. Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir
2014	J	`jnl`	An overview of ORP Ann. Oper. Res. Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir
2013	J	`jnl`	Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs. Algorithmica Avivit Lazar, Arie Tamir
2012	J	`jnl`	Centdian Computation in Cactus Graphs. J. Graph Algorithms Appl. Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir
2012	J	`jnl`	Cooperative location games based on the minimum diameter spanning Steiner subgraph problem. Discret. Appl. Math. Justo Puerto, Arie Tamir, Federico Perea
2011	J	`jnl`	A cooperative location game based on the 1-center location problem. Eur. J. Oper. Res. Justo Puerto, Arie Tamir, Federico Perea
2010	C	`conf`	Centdian Computation for Sensor Networks. TAMC Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir
2010	J	`jnl`	On the Planar Piecewise Quadratic 1-Center Problem. Algorithmica Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir
2010	—	`conf`	Some new cooperative coverage facility location games. BQGT Justo Puerto, Arie Tamir, Federico Perea
2009	J	`jnl`	Aggregation error for location models: survey and analysis. Ann. Oper. Res. Richard L. Francis, Timothy J. Lowe, M. Brenda Rayco, Arie Tamir
2009	J	`jnl`	An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width. Oper. Res. Lett. Olga Gluchshenko, Horst W. Hamacher, Arie Tamir
2009	J	`jnl`	Collection depots facility location problems in trees. Networks Robert Benkoczi, Binay K. Bhattacharya, Arie Tamir
2009	J	`jnl`	Combinatorial fiber-tracking of the human brain. NeuroImage Shlomi Lifshits, Arie Tamir, Yaniv Assaf
2009	J	`jnl`	Minimax Regret Single-Facility Ordered Median Location Problems on Networks. INFORMS J. Comput. Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir
2009	J	`jnl`	Minimax flow tree problems. Networks Hui Chen, Ann Melissa Campbell, Barrett W. Thomas, Arie Tamir
2009	J	`jnl`	New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems. Oper. Res. Lett. Arie Tamir
2009	J	`jnl`	Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. Algorithmica Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir
2009	J	`jnl`	Optimal location with equitable loads. Ann. Oper. Res. Oded Berman, Zvi Drezner, Arie Tamir, George O. Wesolowsky
2008	J	`jnl`	Center location problems on tree graphs with subtree-shaped customers. Discret. Appl. Math. Justo Puerto, Arie Tamir, Juan A. Mesa, Dionisio Pérez-Brito
2008	J	`jnl`	Minimum L Oper. Res. Lett. Pei-Hao Ho, Arie Tamir, Bang Ye Wu
2007	J	`jnl`	Efficient algorithms for center problems in cactus networks. Theor. Comput. Sci. Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir
2007	A	`conf`	New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks. ESA Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir
2006	J	`jnl`	Locating two obnoxious facilities using the weighted maximin criterion. Oper. Res. Lett. Arie Tamir
2006	B	`conf`	Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. ISAAC Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir
2006	J	`jnl`	The bi-criteria doubly weighted center-median path problem on a tree. Networks Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir, Dionisio Pérez-Brito
2005	J	`jnl`	Conditional location of path and tree shaped facilities on trees. J. Algorithms Arie Tamir, Justo Puerto, Juan A. Mesa, Antonio M. Rodríguez-Chía
2005	J	`jnl`	Locating tree-shaped facilities using the ordered median objective. Math. Program. Justo Puerto, Arie Tamir
2005	J	`jnl`	One-way and round-trip center location problems. Discret. Optim. Arie Tamir, Nir Halman
2004	J	`jnl`	A framework for demand point and solution space aggregation analysis for location models. Eur. J. Oper. Res. Richard L. Francis, Timothy J. Lowe, Arie Tamir, Hülya Emir-Farinas
2004	J	`jnl`	An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks. Networks Arie Tamir
2004	J	`jnl`	Continuous bottleneck tree partitioning problems. Discret. Appl. Math. Nir Halman, Arie Tamir
2004	J	`jnl`	Sorting weighted distances with applications to objective function evaluations in single facility location problems. Oper. Res. Lett. Arie Tamir
2003	J	`jnl`	Improved algorithms for several network location problems with equality measures. Discret. Appl. Math. Juan A. Mesa, Justo Puerto, Arie Tamir
2003	J	`jnl`	Minimizing the sum of the k largest functions in linear time. Inf. Process. Lett. Wlodzimierz Ogryczak, Arie Tamir
2003	J	`jnl`	The geometric maximum traveling salesman problem. J. ACM Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
2002	J	`jnl`	Algorithmic results for ordered median problems. Oper. Res. Lett. Jörg Kalcsics, Stefan Nickel, Justo Puerto, Arie Tamir
2002	J	`jnl`	The Geometric Maximum Traveling Salesman Problem CoRR Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
2002	J	`jnl`	The centdian subtree on tree networks. Discret. Appl. Math. Arie Tamir, Justo Puerto, Dionisio Pérez-Brito
2002	J	`jnl`	Worst-case incremental analysis for a class of p-facility location problems. Networks Richard L. Francis, Timothy J. Lowe, Arie Tamir
2001	J	`jnl`	Emanuel Melachrinoudis and Frank GuangSheng Zhang, "An Comput. Oper. Res. Arie Tamir
2001	J	`jnl`	The k-centrum multi-facility location problem. Discret. Appl. Math. Arie Tamir
2000	J	`jnl`	Aggregation Error Bounds for a Class of Location Models. Oper. Res. Richard L. Francis, Timothy J. Lowe, Arie Tamir
2000	J	`jnl`	Optimal Facility Location Under Various Distance Functions. Int. J. Comput. Geom. Appl. Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir
1999	J	`jnl`	A Comput. Oper. Res. M. Brenda Rayco, Richard L. Francis, Arie Tamir
1998	J	`jnl`	A maximum b-matching problem arising from median location models with applications to the roommates problem. Math. Program. Arie Tamir, Joseph S. B. Mitchell
1998	J	`jnl`	A polynomial algorithm for the p-centdian problem on a tree. Networks Arie Tamir, Dionisio Pérez-Brito, José A. Moreno-Pérez
1998	J	`jnl`	Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem. Discret. Appl. Math. Arie Tamir
1997	J	`jnl`	Approximation algorithms for maximum dispersion. Oper. Res. Lett. Refael Hassin, Shlomi Rubinstein, Arie Tamir
1997	J	`jnl`	Structured Oper. Res. Lett. Vernon Ning Hsu, Timothy J. Lowe, Arie Tamir
1996	J	`jnl`	An O(pn Oper. Res. Lett. Arie Tamir
1996	J	`jnl`	Capacitated Location Problems on a Line. Transp. Sci. Prakash Mirchandani, Rajeev Kohli, Arie Tamir
1996	J	`jnl`	On the location of a tree-shaped facility. Networks Tae Ung Kim, Timothy J. Lowe, Arie Tamir, James E. Ward
1995	J	`jnl`	Least Majorized Elements and Generalized Polymatroids. Math. Oper. Res. Arie Tamir
1995	J	`jnl`	On the Minimum Diameter Spanning Tree Problem. Inf. Process. Lett. Refael Hassin, Arie Tamir
1994	J	`jnl`	A distance constrained p-facility location problem on the real line. Math. Program. Arie Tamir
1993	J	`jnl`	A Unifying Location Model on Tree Graphs Based on Submodularity Properties. Discret. Appl. Math. Arie Tamir
1993	J	`jnl`	A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks. Math. Program. Arie Tamir
1993	J	`jnl`	Complexity results for the p-median problem with mutual communication. Oper. Res. Lett. Arie Tamir
1993	J	`jnl`	Linear time algorithms for some separable quadratic programming problems. Oper. Res. Lett. Nimrod Megiddo, Arie Tamir
1993	J	`jnl`	Locating Service Centers with Precedence Constraints. Discret. Appl. Math. Y. Kaufman, Arie Tamir
1993	J	`jnl`	On the Core of Cost Allocation Games Defined on Location Problems. Transp. Sci. Arie Tamir
1993	J	`jnl`	The least element property of center location on tree networks with applications to distance and precedence constrained problems. Math. Program. Arie Tamir
1993	J	`jnl`	Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Math. Program. Dorit S. Hochbaum, Nimrod Megiddo, Joseph Naor, Arie Tamir
1992	J	`jnl`	Distance-constrained multifacility minimax location problems on tree networks. Networks Erhan Erkut, Richard L. Francis, Arie Tamir
1992	J	`jnl`	On a tree-shaped facility location problem of Minieka. Networks Ramon Rabinovitch, Arie Tamir
1992	J	`jnl`	Technical Note - On the Complexity of Some Classes of Location Problems. Transp. Sci. Arie Tamir
1992	J	`jnl`	The generalized Networks Arie Tamir, Timothy J. Lowe
1991	J	`jnl`	Improved complexity bounds for location problems on the real line. Oper. Res. Lett. Refael Hassin, Arie Tamir
1991	J	`jnl`	Obnoxious Facility Location on Graphs. SIAM J. Discret. Math. Arie Tamir
1991	J	`jnl`	On the core of network synthesis games. Math. Program. Arie Tamir
1990	J	`jnl`	Algebraic Optimization: The Fermat-Weber Location Problem. Math. Program. R. Chandrasekaran, Arie Tamir
1989	J	`jnl`	Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems. Oper. Res. Erhan Erkut, Richard L. Francis, Timothy J. Lowe, Arie Tamir
1989	J	`jnl`	Maximizing Classes of Two-Parameter Objectives Over Matroids. Math. Oper. Res. Refael Hassin, Arie Tamir
1989	J	`jnl`	Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem. Math. Program. Ramaswamy Chandrasekaran, Arie Tamir
1988	J	`jnl`	Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures. SIAM J. Discret. Math. Arie Tamir
1988	J	`jnl`	The minimax multistop location problem on a tree. Networks Oded Berman, David Simchi-Levi, Arie Tamir
1987	J	`jnl`	On the Solution Value of the Continuous Math. Oper. Res. Arie Tamir
1987	J	`jnl`	Totally balanced and totally unimodular matrices defined by center location problems. Discret. Appl. Math. Arie Tamir
1985	J	`jnl`	A finite algorithm for the continuous Math. Program. Arie Tamir
1985	J	`jnl`	Minimum cost flow algorithms for series-parallel networks. Discret. Appl. Math. Wolfgang W. Bein, Peter Brucker, Arie Tamir
1984	J	`jnl`	Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games. Math. Program. R. Chandrasekaran, Arie Tamir
1984	J	`jnl`	Polynomial testing of the query "IS a Discret. Appl. Math. Ramaswamy Chandrasekaran, Arie Tamir
1983	J	`jnl`	New Results on the Complexity of p-Center Problems. SIAM J. Comput. Nimrod Megiddo, Arie Tamir
1982	J	`jnl`	Locating Centers on a Tree with Discontinuous Supply and Demand Regions. Math. Oper. Res. Arie Tamir, Eitan Zemel
1982	J	`jnl`	On the complexity of locating linear facilities in the plane. Oper. Res. Lett. Nimrod Megiddo, Arie Tamir
1982	J	`jnl`	On the solution of discrete bottleneck problems. Discret. Appl. Math. Arie Tamir
1982	J	`jnl`	Polynomially bounded algorithms for locating Math. Program. R. Chandrasekaran, Arie Tamir
1981	J	`jnl`	An O(n log SIAM J. Comput. Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran
1980	J	`jnl`	An O ((nlog p) SIAM J. Algebraic Discret. Methods Ramaswamy Chandrasekaran, Arie Tamir
1980	J	`jnl`	The use of jacobi's lemma in unimodularity theory. Math. Program. Moshe Kress, Arie Tamir
1978	J	`jnl`	An O(N log N) Algorithm for a Class of Matching Problems. SIAM J. Comput. Nimrod Megiddo, Arie Tamir
1977	J	`jnl`	Ergodicity and symmetric mathematical programs. Math. Program. Arie Tamir
1976	J	`jnl`	On the number of solutions to the linear comple-mentarity problem. Math. Program. Arie Tamir
1974	J	`jnl`	Minimality and complementarity properties associated with Z-functions and M-functions. Math. Program. Arie Tamir
1973	J	`jnl`	On a characterization of P-matrices. Math. Program. Arie Tamir
1972	J	`jnl`	On "an efficient algorithm for minimizing barrier and penalty functions". Math. Program. Arie Tamir