default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArie Tamir
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j94]Richard L. Church, Zvi Drezner
, Frank Plastria, Arie Tamir:
Reviewing extensions and solution methods of the planar Weber single facility location problem. Comput. Oper. Res. 173: 106825 (2025)- 2022
- [j93]Richard L. Church, Zvi Drezner, Arie Tamir:
Extensions to the Weber problem. Comput. Oper. Res. 143: 105786 (2022) - 2020
- [j92]Mark Rozanov, Arie Tamir:
The nestedness property of the convex ordered median location problem on a tree. Discret. Optim. 36: 100581 (2020)
2010 – 2019
- 2017
- [j91]Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir:
Revisiting k-sum optimization. Math. Program. 165(2): 579-604 (2017) - 2014
- [j90]Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir:
An overview of ORP3-OR for young researchers and practitioners. Ann. Oper. Res. 222(1): 1-3 (2014) - 2013
- [j89]Avivit Lazar, Arie Tamir:
Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs. Algorithmica 66(3): 615-640 (2013) - 2012
- [j88]Justo Puerto, Arie Tamir, Federico Perea:
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem. Discret. Appl. Math. 160(7-8): 970-979 (2012) - [j87]Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir:
Centdian Computation in Cactus Graphs. J. Graph Algorithms Appl. 16(2): 199-224 (2012) - 2011
- [j86]Justo Puerto, Arie Tamir, Federico Perea:
A cooperative location game based on the 1-center location problem. Eur. J. Oper. Res. 214(2): 317-330 (2011) - 2010
- [j85]Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir:
On the Planar Piecewise Quadratic 1-Center Problem. Algorithmica 57(2): 252-283 (2010) - [c4]Justo Puerto, Arie Tamir, Federico Perea:
Some new cooperative coverage facility location games. BQGT 2010: 78:1-78:3 - [c3]Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir:
Centdian Computation for Sensor Networks. TAMC 2010: 187-198
2000 – 2009
- 2009
- [j84]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) - [j83]Richard L. Francis, Timothy J. Lowe, M. Brenda Rayco, Arie Tamir:
Aggregation error for location models: survey and analysis. Ann. Oper. Res. 167(1): 171-208 (2009) - [j82]Oded Berman, Zvi Drezner, Arie Tamir, George O. Wesolowsky:
Optimal location with equitable loads. Ann. Oper. Res. 167(1): 307-325 (2009) - [j81]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): 77-87 (2009) - [j80]Robert Benkoczi, Binay K. Bhattacharya, Arie Tamir:
Collection depots facility location problems in trees. Networks 53(1): 50-62 (2009) - [j79]Hui Chen, Ann Melissa Campbell, Barrett W. Thomas, Arie Tamir:
Minimax flow tree problems. Networks 54(3): 117-129 (2009) - [j78]Shlomi Lifshits, Arie Tamir, Yaniv Assaf:
Combinatorial fiber-tracking of the human brain. NeuroImage 48(3): 532-540 (2009) - [j77]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) - [j76]Arie Tamir:
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems. Oper. Res. Lett. 37(5): 303-306 (2009) - 2008
- [j75]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): 2890-2910 (2008) - [j74]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
- [j73]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) - [c2]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 - 2006
- [j72]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) - [j71]Arie Tamir:
Locating two obnoxious facilities using the weighted maximin criterion. Oper. Res. Lett. 34(1): 97-105 (2006) - [c1]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 - 2005
- [j70]Arie Tamir, Nir Halman:
One-way and round-trip center location problems. Discret. Optim. 2(2): 168-184 (2005) - [j69]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) - [j68]Justo Puerto, Arie Tamir:
Locating tree-shaped facilities using the ordered median objective. Math. Program. 102(2): 313-338 (2005) - 2004
- [j67]Nir Halman, Arie Tamir:
Continuous bottleneck tree partitioning problems. Discret. Appl. Math. 140(1-3): 185-206 (2004) - [j66]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): 574-585 (2004) - [j65]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) - [j64]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
- [j63]Juan A. Mesa, Justo Puerto, Arie Tamir:
Improved algorithms for several network location problems with equality measures. Discret. Appl. Math. 130(3): 437-448 (2003) - [j62]Wlodzimierz Ogryczak, Arie Tamir:
Minimizing the sum of the k largest functions in linear time. Inf. Process. Lett. 85(3): 117-122 (2003) - [j61]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
- [j60]Arie Tamir, Justo Puerto, Dionisio Pérez-Brito:
The centdian subtree on tree networks. Discret. Appl. Math. 118(3): 263-278 (2002) - [j59]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) - [j58]Jörg Kalcsics, Stefan Nickel, Justo Puerto, Arie Tamir:
Algorithmic results for ordered median problems. Oper. Res. Lett. 30(3): 149-158 (2002) - [i1]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) - 2001
- [j57]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. Comput. Oper. Res. 28(2): 189 (2001) - [j56]Arie Tamir:
The k-centrum multi-facility location problem. Discret. Appl. Math. 109(3): 293-307 (2001) - 2000
- [j55]Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir:
Optimal Facility Location Under Various Distance Functions. Int. J. Comput. Geom. Appl. 10(5): 523-534 (2000) - [j54]Richard L. Francis, Timothy J. Lowe, Arie Tamir:
Aggregation Error Bounds for a Class of Location Models. Oper. Res. 48(2): 294-307 (2000)
1990 – 1999
- 1999
- [j53]M. Brenda Rayco, Richard L. Francis, Arie Tamir:
A p-center grid-positioning aggregation procedure. Comput. Oper. Res. 26(10-11): 1113-1124 (1999) - 1998
- [j52]Arie Tamir:
Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem. Discret. Appl. Math. 87(1-3): 229-243 (1998) - [j51]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) - [j50]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
- [j49]Refael Hassin, Shlomi Rubinstein, Arie Tamir:
Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21(3): 133-137 (1997) - [j48]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
- [j47]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) - [j46]Arie Tamir:
An O(pn2) algorithm for the p-median and related problems on tree graphs. Oper. Res. Lett. 19(2): 59-64 (1996) - [j45]Prakash Mirchandani, Rajeev Kohli, Arie Tamir:
Capacitated Location Problems on a Line. Transp. Sci. 30(1): 75-80 (1996) - 1995
- [j44]Refael Hassin, Arie Tamir:
On the Minimum Diameter Spanning Tree Problem. Inf. Process. Lett. 53(2): 109-111 (1995) - [j43]Arie Tamir:
Least Majorized Elements and Generalized Polymatroids. Math. Oper. Res. 20(3): 583-589 (1995) - 1994
- [j42]Arie Tamir:
A distance constrained p-facility location problem on the real line. Math. Program. 66: 201-204 (1994) - 1993
- [j41]Y. Kaufman, Arie Tamir:
Locating Service Centers with Precedence Constraints. Discret. Appl. Math. 47(3): 251-261 (1993) - [j40]Arie Tamir:
A Unifying Location Model on Tree Graphs Based on Submodularity Properties. Discret. Appl. Math. 47(3): 275-283 (1993) - [j39]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) - [j38]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) - [j37]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) - [j36]Nimrod Megiddo, Arie Tamir:
Linear time algorithms for some separable quadratic programming problems. Oper. Res. Lett. 13(4): 203-211 (1993) - [j35]Arie Tamir:
Complexity results for the p-median problem with mutual communication. Oper. Res. Lett. 14(2): 79-84 (1993) - [j34]Arie Tamir:
On the Core of Cost Allocation Games Defined on Location Problems. Transp. Sci. 27(1): 81-86 (1993) - 1992
- [j33]Erhan Erkut, Richard L. Francis, Arie Tamir:
Distance-constrained multifacility minimax location problems on tree networks. Networks 22(1): 37-54 (1992) - [j32]Arie Tamir, Timothy J. Lowe:
The generalized P-forest problem on a tree network. Networks 22(3): 217-230 (1992) - [j31]Ramon Rabinovitch, Arie Tamir:
On a tree-shaped facility location problem of Minieka. Networks 22(6): 515-522 (1992) - [j30]Arie Tamir:
Technical Note - On the Complexity of Some Classes of Location Problems. Transp. Sci. 26(4): 352-354 (1992) - 1991
- [j29]Arie Tamir:
On the core of network synthesis games. Math. Program. 50: 123-135 (1991) - [j28]Refael Hassin, Arie Tamir:
Improved complexity bounds for location problems on the real line. Oper. Res. Lett. 10(7): 395-402 (1991) - [j27]Arie Tamir:
Obnoxious Facility Location on Graphs. SIAM J. Discret. Math. 4(4): 550-567 (1991) - 1990
- [j26]R. Chandrasekaran, Arie Tamir:
Algebraic Optimization: The Fermat-Weber Location Problem. Math. Program. 46: 219-224 (1990)
1980 – 1989
- 1989
- [j25]Erhan Erkut, Richard L. Francis, Timothy J. Lowe, Arie Tamir:
Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems. Oper. Res. 37(3): 447-461 (1989) - [j24]Refael Hassin, Arie Tamir:
Maximizing Classes of Two-Parameter Objectives Over Matroids. Math. Oper. Res. 14(2): 362-375 (1989) - [j23]Ramaswamy Chandrasekaran, Arie Tamir:
Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem. Math. Program. 44(1-3): 293-295 (1989) - 1988
- [j22]Oded Berman, David Simchi-Levi, Arie Tamir:
The minimax multistop location problem on a tree. Networks 18(1): 39-49 (1988) - [j21]Arie Tamir:
Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures. SIAM J. Discret. Math. 1(3): 377-396 (1988) - 1987
- [j20]Arie Tamir:
Totally balanced and totally unimodular matrices defined by center location problems. Discret. Appl. Math. 16(3): 245-263 (1987) - [j19]Arie Tamir:
On the Solution Value of the Continuous p-Center Location Problem on a Graph. Math. Oper. Res. 12(2): 340-349 (1987) - 1985
- [j18]Wolfgang W. Bein, Peter Brucker, Arie Tamir:
Minimum cost flow algorithms for series-parallel networks. Discret. Appl. Math. 10(2): 117-124 (1985) - [j17]Arie Tamir:
A finite algorithm for the continuousp-center location problem on a graph. Math. Program. 31(3): 298-306 (1985) - 1984
- [j16]Ramaswamy Chandrasekaran, Arie Tamir:
Polynomial testing of the query "IS ab ≥ cd?" with application to finding a minimal cost reliability ratio spanning tree. Discret. Appl. Math. 9(2): 117-123 (1984) - [j15]R. Chandrasekaran, Arie Tamir:
Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games. Math. Program. 30(3): 326-339 (1984) - 1983
- [j14]Nimrod Megiddo, Arie Tamir:
New Results on the Complexity of p-Center Problems. SIAM J. Comput. 12(4): 751-758 (1983) - 1982
- [j13]Arie Tamir:
On the solution of discrete bottleneck problems. Discret. Appl. Math. 4(4): 299-302 (1982) - [j12]Arie Tamir, Eitan Zemel:
Locating Centers on a Tree with Discontinuous Supply and Demand Regions. Math. Oper. Res. 7(2): 183-197 (1982) - [j11]R. Chandrasekaran, Arie Tamir:
Polynomially bounded algorithms for locating p-centers on a tree. Math. Program. 22(1): 304-315 (1982) - [j10]Nimrod Megiddo, Arie Tamir:
On the complexity of locating linear facilities in the plane. Oper. Res. Lett. 1(5): 194-197 (1982) - 1981
- [j9]Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran:
An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. SIAM J. Comput. 10(2): 328-337 (1981) - 1980
- [j8]Moshe Kress, Arie Tamir:
The use of jacobi's lemma in unimodularity theory. Math. Program. 18(1): 344-348 (1980) - [j7]Ramaswamy Chandrasekaran, Arie Tamir:
An O ((nlog p)2) Algorithm for the Continuous p-Center Problem on a Tree. SIAM J. Algebraic Discret. Methods 1(4): 370-375 (1980)
1970 – 1979
- 1978
- [j6]Nimrod Megiddo, Arie Tamir:
An O(N log N) Algorithm for a Class of Matching Problems. SIAM J. Comput. 7(2): 154-157 (1978) - 1977
- [j5]Arie Tamir:
Ergodicity and symmetric mathematical programs. Math. Program. 13(1): 81-87 (1977) - 1976
- [j4]Arie Tamir:
On the number of solutions to the linear comple-mentarity problem. Math. Program. 10(1): 347-353 (1976) - 1974
- [j3]Arie Tamir:
Minimality and complementarity properties associated with Z-functions and M-functions. Math. Program. 7(1): 17-31 (1974) - 1973
- [j2]Arie Tamir:
On a characterization of P-matrices. Math. Program. 4(1): 110-112 (1973) - 1972
- [j1]Arie Tamir:
On "an efficient algorithm for minimizing barrier and penalty functions". Math. Program. 3(1): 390-391 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
