Arie TAMIR
LIST OF PUBLICATIONS
ARTICLES
- A. Tamir
On an efficient algorithm for minimizing barrier and penalty
functions.
Mathematical Programming 3
(1972), 390-391.
- A. Tamir
On a characterization of P-matrices.
Mathematical Programming 4
(1973), 110-112.
- A. Tamir
Minimality and
complementarity properties associated with Z-functions
and M-functions.
Mathematical Programming 7
(1974), 17-31.
- R. Fox, A. Lasdon, A. Tamir, M. Ratner
An efficient one dimensional
search.
Management Science 22
(1975), 42-50.
- A. Tamir
Line search techniques based on
interpolating polynomials using
function values only.
Management Science 22
(1976), 576-586.
- A. Tamir
An application of Z-matrices
to a class of resource allocation
problems.
Management Science 23
(1976), 317-323.
- A. Tamir
On the number of solutions to
the linear complementarity problem.
Mathematical Programming 10
(1976), 347-353.
- A. Tamir
On totally unimodular matrices.
Networks 6 (1976),
1-9.
- A. Tamir
Further note on market
equilibrium with fixed supply.
J. of Economic Theory 15
(1977), 392-393.
- A. Tamir
Ergodicity and symmetric
mathematical programs.
Mathematical Programming 13
(1977), 81-86.
- N.
Megiddo, A. Tamir
An O(N log N) algorithm for a class of matching
problems.
SIAM J. of Computing 7
(1978), 154-159.
- A. Tamir
Rates of convergence of a one
dimensional search based on
interpolating polynomials.
J. of Optimization Theory and Applications 27
(1979), 187-203.
- A. Tamir
Scheduling jobs to two machines subject to batch arrival ordering.
Naval Research Logistic Quarterly 26
(1979), 521-525.
- A. Felzenbaum, A. Tamir
Cyclic permutations and
nearly symmetric integer vectors.
Linear Algebra and Its Applications 27
(1979), 159-166.
- A. Tamir
Efficient algorithms for a selection problem with nested
constraints and its application to a production sales planning
model.
SIAM J. on Control and Optimization 18
(1980), 282-287.
- M. Kress, A. Tamir
The use of Jacobi's lemma in unimodularity theory.
Mathematical Programming 18
(1980), 344-348.
- R.
Chandrasekaran, A. Tamir
An O(n2log2n)
algorithm for the continuous p-center
problem on a tree.
SIAM J. on Algebraic and Discrete Methods 1
(1980), 370-375.
- T. Agmon, A.R. Ofer, A. Tamir
Variable rate debt instruments and corporate debt policy.
The Journal of Finance 36
(1981), 113-125.
- N.
Megiddo, A. Tamir, E. Zemel,
R.
Chandrasekaran
An O(n log2n) algorithm for
the K-th longest path in a tree
with applications to location problems.
SIAM J. on Computing 10
(1981), 328-337.
- M. Barel, A. Tamir
Nested matrices and the
existence of least majorized elements.
Linear Algebra and Its Applications 38
(1981), 65-72.
- R.
Chandrasekaran, A. Tamir
Polynomially bounded algorithms
for locating p-centers
on a tree.
Mathematical Programming 22
(1982), 304-315.
- A. Tamir, E. Zemel
Locating centers on a tree
with discontinuous supply and demand
regions.
Mathematics of Operations Research 7
(1982), 183-197.
- A. Tamir
On the solution of discrete
bottleneck problems.
Discrete Applied Mathematics 4
(1982), 299-302.
- A. Tamir
A class of balanced matrices
arising from location problems.
SIAM J. on Algebraic and Discrete Methods 4
(1983), 363-370.
- N.
Megiddo, A. Tamir
Finding least distance lines.
SIAM J. on Algebraic and Discrete Methods 4
(1983), 207-211.
- N.
Megiddo, A. Tamir
On the complexity of locating linear facilities in the plane.
Operations Research Letters 1
(1983), 194-197.
- N.
Megiddo, A. Tamir
New results on the complexity of p-center problems.
SIAM J. on Computing 12
(1983), 751-758.
- I.
Meilijson, A. Tamir
Minimizing flow time on
identical processors with variable
processing rate.
Operations Research 32
(1984), 440-448.
- R.
Chandrasekaran, A. Tamir
Polynomial testing of the query
"Is ab>cd?"
with
application to finding a minimal cost reliability ratio spanning tree.
Discrete Applied Mathematics 9
(1984), 117-123.
- R.
Chandraskaran, A. Tamir
Optimization problems with
algebraic solutions: quadratic
fractional programs and ratio games.
Mathematical Programming 30
(1984), 326-339.
- R.
Chandrasekaran, A. Tamir
On the integrality of an
extreme solution to pluperfect graph and
balanced systems.
Operations Research Letters 3
(1984), 215-218.
- A. Tamir
A finite algorithm for the continuous p-center
location problem
on a graph.
Mathematical Programming 31
(1985), 298-306.
- W.W.
Bein, P.
Brucker, A. Tamir
Minimum cost flow algorithms for
series-parallel networks.
Discrete Applied Mathematics 10
(1985), 117-124.
- R.
Hassin, A. Tamir
Efficient algorithms for optimization and selection on series-
parallel graphs.
SIAM J. on Algebraic and Discrete Methods 7
(1986), 379-389.
- A. Tamir
On the solution value of the continuous p-center
location problem
on a graph.
Mathematics of Operations Research 12
(1987), 340-349.
- A. Tamir
Totally balanced and totally unimodular matrices defined by
center location problems.
Discrete Applied Mathematics 16
(1987), 245-263.
- O.
Berman, D.
Simchi-Levi, A. Tamir
The minimax multistop location problem.
Networks 18
(1988), 39-49.
- A. Tamir
Improved complexity bounds for center location problems on
networks by using dynamic data structures.
SIAM J. on Discrete Mathematics 1
(1988), 377-396.
- R.
Hassin, A. Tamir
Maximizing classes of two parameter objectives over matroids.
Mathematics of Operations Research 14
(1989), 362-375.
- E. Erkut, R.L.
Francis, T.J.
Lowe, A. Tamir
Equivalent mathematical
programming formulations of monotonic
tree network location problems.
Operations Research 37
(1989), 447-461.
- A. Tamir
On the core of a traveling
salesman cost allocation game.
Operations Research Letters 8
(1989), 31-34.
- R.
Chandrasekaran, A. Tamir
Open questions concerning
Weiszfeld's algorithm for the
Fermat-Weber location problem.
Mathematical Programming 44
(1989), 293-295.
- R.
Chandrasekaran, A. Tamir
Algebraic optimization: The
Fermat-Weber location problem.
Mathematical Programming 46
(1990), 219-224.
- A. Tamir
On the core of network
synthesis games.
Mathematical Programming 50
(1991), 123-135.
- A. Tamir
Obnoxious facility location
on graphs.
SIAM J. on Discrete Mathematics 4
(1991), 550-567.
- R.
Hassin, A. Tamir
Improved complexity bounds for location problems on the real
line.
Operations Research Letters 10
(1992), 395-402.
- E. Erkut, R.L.
Francis, A. Tamir
Distance constrained multifacility minimax location problems on
tree networks.
Networks 22
(1992), 37-54.
- A. Tamir, T.
Lowe
The generalized p-forest
problem on a tree network.
Networks 22
(1992), 217-230.
- R.
Hassin, A. Tamir
Minimal length curves that are not embeddable in an open planar
set: The problem of a lost swimmer with a compass.
SIAM J. Control and Optimization 30
(1992), 695-703.
- A. Tamir
On the complexity of some classes of location problems.
Transportation Science 26 (1992), 352-354.
- R. Rabinovitch, A. Tamir
On a tree-shaped facility
location problem of Minieka.
Networks 22
(1992), 515-522.
- A. Tamir
On the core of cost allocation games defined on location
problems.
Transportation Science 27
(1993), 81-86.
- A. Tamir
A strongly polynomial
algorithm for minimum convex separable
quadratic cost flow problems on two-terminal series parallel
graphs.
Mathematical Programming 59
(1993), 117-132.
- N.
Megiddo, A. Tamir
Linear time algorithms for some separable quadratic programming
problems.
Operations Research Letters 13
(1993), 203-211.
- Y. Kaufman, A. Tamir
Locating centers with
precedence constraints.
Discrete Applied Mathematics 47
(1993), 251-261.
- A. Tamir
A unifying location model on
tree graphs based on submodularity
properties.
Discrete Applied Mathematics 47 (1993),
275-293.
- D.S.
Hochbaum, N.
Megiddo, J.
Naor, A. Tamir
Tight bounds and
2-approximations algorithms for integer programs
with two variables per inequality.
Mathematical Programming 62
(1993), 69-83.
- A. Tamir
The least element property of center location on tree networks
with applications to distance and precedence constrained
problems.
Mathematical Programming 62
(1993), 475-496.
- A. Tamir
Complexity results for the p-median
problem with
mutual
communication.
Operations Research Letters 14
(1993), 79-84.
- A. Tamir
A distance constrained p-facility location problem
on the
real line.
Mathematical Programming 66
(1994), 201-204.
- A. Tamir
Least majorized elements and
generalized polymatroids.
Mathematics of Operations Research 20
(1995), 583-590.
- R.
Hassin, A. Tamir
On the minimum diameter spanning tree problem.
Information Processing Letters 53
(1995), 109-111.
- P.
Mirchandani, R. Kohli, A. Tamir
Capacitated location problems on a line.
Transportation Science 30
(1996), 75-80.
- T.U. Kim, T.J.
Lowe, A. Tamir, J.E. Ward
On the location of a tree-shaped facility.
Networks 28
(1996), 167-175.
- A. Tamir
An O(pn2)
algorithm for the p-median
and
related problems on tree graphs.
Operations Research Letters 19
(1996), 59-64.
- F.
Granot, J.
Skorin-Kapov, A. Tamir
Using quadratic programming to
solve high multiplicity scheduling
problems on parallel machines.
Algorithmica 17
(1997), 100-110.
- R.
Hassin, S. Rubinstein, A. Tamir
Approximation algorithms for maximum facility dispersion.
Operations Research Letters 21
(1997), 133-137.
- V.N. Hsu, T.J.
Lowe, A. Tamir
Structured p-facility
location problems on the line
solvable
in polynomial time.
Operations Research Letters 21
(1997), 159-164.
- A. Tamir
Comments on the paper: "Heuristic and special case algorithms
for dispersion problems", by S.S.Ravi, D.J.Rosenkrantz and
G.K.Tayi.
Operations Research 46 (1998), 157-158.
- A. Tamir, J.S.B.
Mitchell
A maximum b-matching
problem arising from median
location
models with applications to the roommates problem.
Mathematical Programming 80
(1998), 171-194.
- Y. Konforty, A. Tamir
The rectilinear single facility location problem with minimum
distance constraints.
Location Science 5
(1998), 147-163.
- A. Tamir
Fully polynomial approximation
schemes for locating a tree-shaped
facility: A generalization of the knapsack problem.
Discrete Applied Mathematics 87
(1998), 229-243.
- A. Tamir, D. Perez-Brito, J.A. Moreno-Perez
A polynomial algorithm for the p-centdian
problem
on a tree.
Networks 32
(1998), 255-262.
- M.B. Rayco, R.L.
Francis, A. Tamir
A p-center grid-positioning aggregation procedure.
Computers and Operations Research 26
(1999), 1113-1124.
- R.L.
Francis, T.J.
Lowe, A. Tamir
Aggregation error bounds for a class of location models.
Operations Research 48
(2000), 294-307.
- S.
Bespamyatnikh, K.
Kedem, M.
Segal, A. Tamir
Optimal facility location under various distance
functions.
International Journal of Computational Geometry
and Applications 10 (2000),
523-534.
- A. Tamir
The k-centrum
multi-facility location problem.
Discrete Applied Mathematics 109
(2001), 293-307.
- A. Tamir, J.
Puerto, D. Perez-Brito
The centdian subtree on tree
networks.
Discrete Applied Mathematics 118
(2002), 263-278.
- R.L.
Francis, T.J.
Lowe, A. Tamir
Worst-case incremental analysis
for a class of p-facility location
problems.
Networks 39
(2002), 139-143.
- J. Kalcsics, S. Nickel,
J. Puerto, A. Tamir
Algorithmic results for ordered
median problems defined on networks
and the plane.
Operations Research Letters 30
(2002), 149-158.
- W.
Ogryczak, A. Tamir
Minimizing the sum of the k-largest
functions in
linear time.
Information Processing Letters 85
(2003), 117-122.
- J.A. Mesa, J.
Puerto, A. Tamir
Improved algorithms for several
network location problems with
equality measures.
Discrete Applied Mathematics 130
(2003), 437-448.
- R.L.
Francis, T.J.
Lowe, M.B. Rayco, A. Tamir
Exploiting self-canceling demand point aggregation error for some
planar rectilinear median problems.
Naval Research Logistics 50
(2003), 614-637.
- A.
Barvinok, S.P.
Fekete, D.S.
Johnson, A. Tamir, G.J.Woeginger,
R. Woodroofe
The geometric maximum traveling salesman problem.
J. ACM 50 (2003),
641-664.
- A. Tamir
Sorting weighted distances with
applications to objective
function evaluations in single facility location problems.
Operations Research Letters 32
(2004), 249-257.
- N.
Halman, A. Tamir
Continuous bottleneck tree
partitioning problems.
Discrete Applied Mathematics 140
(2004), 185-206.
- R.L.
Francis, T.J.
Lowe, A. Tamir
Demand point aggregation analysis for a class of constrained location
models: A penalty function approach.
IIE Transactions 36
(2004), 601-609.
- R.L.
Francis, T.J.
Lowe, A. Tamir, H. Emir-Farinas
A framework for demand point and solution space aggregation analysis
for location models.
European Journal of Operational Research 159
(2004), 574-585.
- A. Tamir
An improved algorithm for the
distance constrained p-center location
problem with mutual communication on tree networks.
Networks 44
(2004), 38-40.
- R.L.
Francis, T.J.
Lowe, A. Tamir, H. Emir-Farinas
Aggregation decomposition and aggregation guidelines for a class of
minimax and covering location models.
Geographical Analysis, 36
(2004), 332-346.
- J.
Puerto, A. Tamir
Locating tree-shaped facilities
using the ordered median objective.
Mathematical Programming, 102
(2005), 313-338.
- A. Tamir,
J. Puerto, J.A. Mesa, A.M. Rodriguez-Chia
Conditional location of path and
tree shaped facilities on trees.
J. of Algorithms, 56
(2005), 50-75.
- A. Tamir, N.
Halman
One-way and round-trip center location problems.
Discrete Optimization, 2
(2005), 168-184.
- A. Tamir
Locating two obnoxious facilities
using the weighted maximin criterion.
Operations Research Letters, 34
(2006), 97-105.
- J.
Puerto, A.M. Rodriguez-Chia, A. Tamir, D. Perez-Brito
The bi-criteria doubly
weighted center-median path problem on a
tree.
Networks, 47
(2006), 237-247.
- B. Ben-Moshe, B. Bhattacharya, Q Shi, A. Tamir
Efficient algorithms for center problems in cactus graphs.
Theoretical Computer Science, 378 (2007), 237-252.
- P.H. Ho, A. Tamir, B.Y. Wu
Minimum Lk path partitioning- An illustration of the Monge property.
Operations Research Letters, 36 (2008), 43-45.
- A. Tamir
Improved algorithms for the multicut and multiflow problems in rooted trees.
TOP, 16 (2008), 114-125.
- J.
Puerto, A. Tamir, J.A. Mesa, D. Perez-Brito
Center location problems on tree graphs with subtree-shaped
customers.
Discrete Applied Mathematics, 156 (2008), 2890-2910.
- R. Benkoczi, B. Bhattacharya, A. Tamir
Collection depots facility
location problems in trees.
Networks, 53 (2009), 50-62.
- R.L.
Francis, T.J.
Lowe, M.B. Rayco, A. Tamir
Aggregation error for location models: Survey and analysis.
Annals of Operations Research, 167 (2009), 171-208.
-
O. Berman, Z. Drezner, A. Tamir, G.O. Wesolowsky
Optimal location with equitable loads.
Annals of Operations Research, 167 (2009), 307-326.
- J.
Puerto, A.M. Rodriguez-Chia, A. Tamir
Minimax regret single facility ordered median location problems on networks.
INFORMS Journal on Computing, 21 (2009), 77-87.
Also, Proceedings, 15-th Annual European Symposium, Eilat, Israel, October 2007,
LNCS 4698 Springer, pp. 230-240.
- O.N. Gluchshenko, H.W. Hamacher, A. Tamir
An optimal O(n log n) algorithm for finding an enclosing planar rectilinear annulus of minimum width.
Operations Research Letters, 37 (2009), 168-170.
- A. Tamir
New pseudopolynomial complexity bounds for the bounded and other
integer knapsack related problems.
Operations Research Letters, 37 (2009), 303-306.
-
B. Bhattacharya, Q. Shi, A. Tamir
Optimal algorithms for the path/tree-shaped facility location problems in trees.
Algorithmica, 55 (2009), 601-618.
-
H. Chen, A.M. Campbell, B.W. Thomas, A. Tamir
Minimax flow tree problems.
Networks 54 (2009), 117-129.
-
S. Lifshits, A. Tamir, Y. Assaf
Combinatorial fiber-tracking of the human brain.
NeuroImage 48 (2009), 532-540.
-
J.
Puerto,
A.M. Rodriguez-Chia, A. Tamir
On the planner piecewise quadratic 1-center problem.
Algorithmica 57 (2010), 252-283.
-
J. Puerto, A.Tamir, F. Perea
A cooperative location game based on the 1-center location problem.
European Journal of Operational Research 214 (2011), 317-330.
-
J. Puerto, A.Tamir, F. Perea
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem.
Discrete Applied Mathematics 160 (2012), 970-979.
-
B. Ben-Moshe, A. Dvir, M. Segal, A. Tamir
Centdian computation for sensor networks.
Journal of Graph Algorithms and Applications 16 (2012), 199-224.
Also, Proceedings, TAMC 2010, June 2010, 187-198.
-
A. Lazar, A. Tamir
Improved algorithms for some competitive location centroid problems on paths, trees and graphs.
Algorithmica 66 (2013), 615-640.
Unpublished Technical Reports
- N.
Megiddo, A. Tamir
An O(p2
log2n) algorithm for the unweighted p-center
problem on the line, (1981). Revised, (1991).
- A. Tamir
A note on the
polynomial solvability of the resource allocation
problem over polymatroids, (1993).
- A. Tamir
Polynomial formulations of
min-cut problems, (1994).
- A. Tamir
Facility location
problems on tree graphs with different
speeds for customers and servers: A study on covering
problems defined by families of subtrees, (2000).
- A. Tamir
Maximum coverage with balls of
different radii, (2003).
CHAPTER IN BOOK
- A. Kolen, A. Tamir
Covering Problems.
P.B. Mirchandani, R.L. Francis, eds., Discrete Location
Theory, Wiley, New York (1990).
- R.L.
Francis, T.J.
Lowe, A. Tamir
Demand Point Aggregation for Location Models.
Z. Drezner, H.W. Hamacher, eds., Facility Location: Applications
and Methods, Springer-Verlag, Berlin (2002).