| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Justo Puerto, Arie Tamir, Federico Perea |
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir |
Centdian Computation in Cactus Graphs. |
J. Graph Algorithms Appl. |
2012 |
DBLP BibTeX RDF |
|
| 1 | Justo Puerto, Arie Tamir, Federico Perea |
A cooperative location game based on the 1-center location problem. |
European Journal of Operational Research |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir |
On the Planar Piecewise Quadratic 1-Center Problem. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir |
Centdian Computation for Sensor Networks. |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Tamir |
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems. |
Oper. Res. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hui Chen, Ann Melissa Campbell, Barrett W. Thomas, Arie Tamir |
Minimax flow tree problems. |
Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Benkoczi, Binay K. Bhattacharya, Arie Tamir |
Collection depots facility location problems in trees. |
Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir |
Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard L. Francis, Timothy J. Lowe, M. Brenda Rayco, Arie Tamir |
Aggregation error for location models: survey and analysis. |
Annals OR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Berman, Zvi Drezner, Arie Tamir, George O. Wesolowsky |
Optimal location with equitable loads. |
Annals OR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir |
Minimax Regret Single-Facility Ordered Median Location Problems on Networks. |
INFORMS Journal on Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pei-Hao Ho, Arie Tamir, Bang Ye Wu |
Minimum Lk path partitioning - An illustration of the Monge property. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Justo Puerto, Arie Tamir, Juan A. Mesa, Dionisio Pérez-Brito |
Center location problems on tree graphs with subtree-shaped customers. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir |
Efficient algorithms for center problems in cactus networks. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
networks, facility location, Analysis of algorithms |
| 1 | Arie Tamir |
Locating two obnoxious facilities using the weighted maximin criterion. |
Oper. Res. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir |
Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Tamir, Nir Halman |
One-way and round-trip center location problems. |
Discrete Optimization |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Justo Puerto, Arie Tamir |
Locating tree-shaped facilities using the ordered median objective. |
Math. Program. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Tamir |
Sorting weighted distances with applications to objective function evaluations in single facility location problems. |
Oper. Res. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Tamir |
An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks. |
Networks |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
European Journal of Operational Research |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nir Halman, Arie Tamir |
Continuous bottleneck tree partitioning problems. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Wlodzimierz Ogryczak, Arie Tamir |
Minimizing the sum of the k largest functions in linear time. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2003 |
DBLP DOI BibTeX RDF |
maximum scatter TSP, polyhedral metric, optimization, NP-hardness, Traveling salesman problem, polynomial time, Euclidean metric |
| 1 | Juan A. Mesa, Justo Puerto, Arie Tamir |
Improved algorithms for several network location problems with equality measures. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Kalcsics, Stefan Nickel, Justo Puerto, Arie Tamir |
Algorithmic results for ordered median problems. |
Oper. Res. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard L. Francis, Timothy J. Lowe, Arie Tamir |
Worst-case incremental analysis for a class of p-facility location problems. |
Networks |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Arie Tamir, Justo Puerto, Dionisio Pérez-Brito |
The centdian subtree on tree networks. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Computers & OR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Tamir |
The k-centrum multi-facility location problem. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir |
Optimal Facility Location Under Various Distance Functions. |
Int. J. Comput. Geometry Appl. |
2000 |
DBLP BibTeX RDF |
|
| 1 | M. Brenda Rayco, Richard L. Francis, Arie Tamir |
A p-center grid-positioning aggregation procedure. |
Computers & OR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Tamir, Dionisio Pérez-Brito, José A. Moreno-Pérez |
A polynomial algorithm for the p-centdian problem on a tree. |
Networks |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Tamir |
Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Tamir, Joseph S. B. Mitchell |
A maximum b-matching problem arising from median location models with applications to the roommates problem. |
Math. Program. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Vernon Ning Hsu, Timothy J. Lowe, Arie Tamir |
Structured p-facility location problems on the line solvable in polynomial time. |
Oper. Res. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Shlomi Rubinstein, Arie Tamir |
Approximation algorithms for maximum dispersion. |
Oper. Res. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Tae Ung Kim, Timothy J. Lowe, Arie Tamir, James E. Ward |
On the location of a tree-shaped facility. |
Networks |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Prakash Mirchandani, Rajeev Kohli, Arie Tamir |
Capacitated Location Problems on a Line. |
Transportation Science |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Arie Tamir |
On the Minimum Diameter Spanning Tree Problem. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Tamir |
A distance constrained p-facility location problem on the real line. |
Math. Program. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Tamir |
A Unifying Location Model on Tree Graphs Based on Submodularity Properties. |
Discrete Applied Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Y. Kaufman, Arie Tamir |
Locating Service Centers with Precedence Constraints. |
Discrete Applied Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Tamir |
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks. |
Math. Program. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Tamir |
The least element property of center location on tree networks with applications to distance and precedence constrained problems. |
Math. Program. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Tamir |
Obnoxious Facility Location on Graphs. |
SIAM J. Discrete Math. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Tamir |
On the core of network synthesis games. |
Math. Program. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Chandrasekaran, Arie Tamir |
Algebraic Optimization: The Fermat-Weber Location Problem. |
Math. Program. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Tamir |
Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures. |
SIAM J. Discrete Math. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Nimrod Megiddo, Arie Tamir |
New Results on the Complexity of p-Center Problems. |
SIAM J. Comput. |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Nimrod Megiddo, Arie Tamir |
An O(N log N) Algorithm for a Class of Matching Problems. |
SIAM J. Comput. |
1978 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")