Arie Tamir

1998

A maximum b-matching problem arising from median location models with applications to the roommates problem

Tamir, A. & Mitchell, J. S. B., 16 Jan 1998, In: Mathematical Programming. 80, 2, p. 171-194 24 p.

Research output: Contribution to journal › Article › peer-review

17 Scopus citations

A polynomial algorithm for the p-centdian problem on a tree

Tamir, A., Pérez-Brito, D. & Moreno-Pérez, J. A., Dec 1998, In: Networks. 32, 4, p. 255-262 8 p.

Research output: Contribution to journal › Article › peer-review

30 Scopus citations

Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem

Tamir, A., 5 Oct 1998, In: Discrete Applied Mathematics. 87, 1-3, p. 229-243 15 p.

Research output: Contribution to journal › Article › peer-review

Open Access

23 Scopus citations

1997

Approximation algorithms for maximum dispersion

Hassin, R., Rubinstein, S. & Tamir, A., Oct 1997, In: Operations Research Letters. 21, 3, p. 133-137 5 p.

Research output: Contribution to journal › Article › peer-review

151 Scopus citations

Structured p-facility location problems on the line solvable in polynomial time

Hsu, V. N., Lowe, T. J. & Tamir, A., Nov 1997, In: Operations Research Letters. 21, 4, p. 159-164 6 p.

Research output: Contribution to journal › Article › peer-review

18 Scopus citations

The single facility location problem with minimum distance constraints

Konforty, Y. & Tamir, A., Oct 1997, In: Location Science. 5, 3, p. 147-163 17 p.

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

Using Quadratic Programming to Solve High Multiplicity Scheduling Problems on Parallel Machines

Granot, F., Skorin-Kapov, J. & Tamir, A., Feb 1997, In: Algorithmica. 17, 2, p. 100-110 11 p.

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

1996

An O(pn² ) algorithm for the p-median and related problems on tree graphs

Tamir, A., Aug 1996, In: Operations Research Letters. 19, 2, p. 59-64 6 p.

Research output: Contribution to journal › Article › peer-review

207 Scopus citations

Capacitated location problems on a line

Mirchandani, P., Kohli, R. & Tamir, A., Feb 1996, In: Transportation Science. 30, 1, p. 75-80 6 p.

Research output: Contribution to journal › Article › peer-review

14 Scopus citations

On the location of a tree-shaped facility

Kim, T. U., Lowe, T. J., Tamir, A. & Ward, J. E., Oct 1996, In: Networks. 28, 3, p. 167-175 9 p.

Research output: Contribution to journal › Article › peer-review

47 Scopus citations

1995

On the minimum diameter spanning tree problem

Hassin, R. & Tamir, A., 27 Jan 1995, In: Information Processing Letters. 53, 2, p. 109-111 3 p.

Research output: Contribution to journal › Article › peer-review

85 Scopus citations

1994

A distance constrained p-facility location problem on the real line

Tamir, A., Aug 1994, In: Mathematical Programming. 66, 1-3, p. 201-204 4 p.

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Distance constrained p-facility location problem on the real line

Tamir, A., 7 Sep 1994, In: Mathematical Programming. 66, 2, p. 201-204 4 p.

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

1993

A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks

Tamir, A., Mar 1993, In: Mathematical Programming. 59, 1-3, p. 117-132 16 p.

Research output: Contribution to journal › Article › peer-review

22 Scopus citations

A unifying location model on tree graphs based on submodularity properties

Tamir, A., 21 Dec 1993, In: Discrete Applied Mathematics. 47, 3, p. 275-283 9 p.

Research output: Contribution to journal › Article › peer-review

Open Access

11 Scopus citations

Complexity results for the p-median problem with mutual communication

Tamir, A., Sep 1993, In: Operations Research Letters. 14, 2, p. 79-84 6 p.

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Linear time algorithms for some separable quadratic programming problems

Megiddo, N. & Tamir, A., May 1993, In: Operations Research Letters. 13, 4, p. 203-211 9 p.

Research output: Contribution to journal › Article › peer-review

52 Scopus citations

Locating service centers with precedence constraints

Kaufman, Y. & Tamir, A., 21 Dec 1993, In: Discrete Applied Mathematics. 47, 3, p. 251-261 11 p.

Research output: Contribution to journal › Article › peer-review

Open Access

12 Scopus citations

On the core of cost allocation games defined on location problems

Tamir, A., 1993, In: Transportation Science. 27, 1, p. 81-86 6 p.

Research output: Contribution to journal › Article › peer-review

30 Scopus citations

Strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks

Tamir, A., 1 Jan 1993, In: Mathematical Programming. 59, 1, p. 117-132 16 p.

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

The least element property of center location on tree networks with applications to distance and precedence constrained problems

Tamir, A., Feb 1993, In: Mathematical Programming. 62, 1-3, p. 475-496 22 p.

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality

Hochbaum, D. S., Megiddo, N., Naor, J. & Tamir, A., Feb 1993, In: Mathematical Programming. 62, 1-3, p. 69-83 15 p.

Research output: Contribution to journal › Article › peer-review

84 Scopus citations

1992

Distance‐constrained multifacility minimax location problems on tree networks

Erkut, E., Francis, R. L. & Tamir, A., Jan 1992, In: Networks. 22, 1, p. 37-54 18 p.

Research output: Contribution to journal › Article › peer-review

18 Scopus citations

Minimal length curves that are not embeddable in an open planar set: the problem of a lost swimmer with a compass

Hassin, R. & Tamir, A., 1992, In: SIAM Journal on Control and Optimization. 30, 3, p. 695-703 9 p.

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

On a tree‐shaped facility location problem of Minieka

Rabinovitch, R. & Tamir, A., Oct 1992, In: Networks. 22, 6, p. 515-522 8 p.

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

On the complexity of some classes of location problems

Tamir, A., 1992, In: Transportation Science. 26, 4, p. 352-354 3 p.

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

The generalized P‐forest problem on a tree network

Tamir, A. & Lowe, T. J., May 1992, In: Networks. 22, 3, p. 217-230 14 p.

Research output: Contribution to journal › Article › peer-review

27 Scopus citations

1991

Improved complexity bounds for location problems on the real line

Hassin, R. & Tamir, A., Oct 1991, In: Operations Research Letters. 10, 7, p. 395-402 8 p.

Research output: Contribution to journal › Article › peer-review

112 Scopus citations

On the core of network synthesis games

Tamir, A., Mar 1991, In: Mathematical Programming. 50, 1-3, p. 123-135 13 p.

Research output: Contribution to journal › Article › peer-review

65 Scopus citations

1990

Algebraic optimization: The Fermat-Weber location problem

Chandrasekaran, R. & Tamir, A., Jan 1990, In: Mathematical Programming. 46, 1-3, p. 219-224 6 p.

Research output: Contribution to journal › Article › peer-review

25 Scopus citations

Algebraic optimization. The Fermat-Weber location problem

Chandrasekaran, R. & Tamir, A., Feb 1990, In: Mathematical Programming. 46, 2, p. 219-224 6 p.

Research output: Contribution to journal › Article › peer-review

48 Scopus citations

1989

Equivalent mathematical programming formulations of monotonic tree network location problems

Erkut, E., Francis, R. L., Lowe, T. J. & Tamir, A., 1989, In: Operations Research. 37, 3, p. 447-461 15 p.

Research output: Contribution to journal › Article › peer-review

14 Scopus citations

On the core of a traveling salesman cost allocation game

Tamir, A., Feb 1989, In: Operations Research Letters. 8, 1, p. 31-34 4 p.

Research output: Contribution to journal › Article › peer-review

47 Scopus citations

Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem

Chandrasekaran, R. & Tamir, A., May 1989, In: Mathematical Programming. 44, 1-3, p. 293-295 3 p.

Research output: Contribution to journal › Article › peer-review

76 Scopus citations

1988

The minimax multistop location problem on a tree

Berman, O., Simchi‐Levi, D. & Tamir, A., 1988, In: Networks. 18, 1, p. 39-49 11 p.

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

1987

ON THE SOLUTION VALUE OF THE CONTINUOUS P-CENTER LOCATION PROBLEM ON A GRAPH.

Tamir, A., 1987, In: Mathematics of Operations Research. 12, 2, p. 340-349 10 p.

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

Totally balanced and totally unimodular matrices defined by center location problems

Tamir, A., Mar 1987, In: Discrete Applied Mathematics. 16, 3, p. 245-263 19 p.

Research output: Contribution to journal › Article › peer-review

Open Access

6 Scopus citations

1985

A finite algorithm for the continuous p-center location problem on a graph

Tamir, A., Oct 1985, In: Mathematical Programming. 31, 3, p. 298-306 9 p.

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Minimum cost flow algorithms for series-parallel networks

Bein, W. W., Brucker, P. & Tamir, A., Feb 1985, In: Discrete Applied Mathematics. 10, 2, p. 117-124 8 p.

Research output: Contribution to journal › Article › peer-review

Open Access

40 Scopus citations

1984

On the integrality of an extreme solution to pluperfect graph and balanced systems

Chandrasekaran, R. & Tamir, A., Oct 1984, In: Operations Research Letters. 3, 4, p. 215-218 4 p.

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games

Chandrasekaran, R. & Tamir, A., Oct 1984, In: Mathematical Programming. 30, 3, p. 326-339 14 p.

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Polynomial testing of the query "IS a^b ≥ c^d?" with application to finding a minimal cost reliability ratio spanning tree

Chandrasekaran, R. & Tamir, A., Oct 1984, In: Discrete Applied Mathematics. 9, 2, p. 117-123 7 p.

Research output: Contribution to journal › Article › peer-review

Open Access

9 Scopus citations

1982

On the complexity of locating linear facilities in the plane

Megiddo, N. & Tamir, A., Nov 1982, In: Operations Research Letters. 1, 5, p. 194-197 4 p.

Research output: Contribution to journal › Article › peer-review

147 Scopus citations

On the solution of discrete bottleneck problems

Tamir, A., Aug 1982, In: Discrete Applied Mathematics. 4, 4, p. 299-302 4 p.

Research output: Contribution to journal › Article › peer-review

Open Access

4 Scopus citations

Polynomially bounded algorithms for locating p-centers on a tree

Chandrasekaran, R. & Tamir, A., Dec 1982, In: Mathematical Programming. 22, 1, p. 304-315 12 p.

Research output: Contribution to journal › Article › peer-review

51 Scopus citations

1981

Nested matrices and the existence of least majorized elements

Barel, M. & Tamir, A., Jun 1981, In: Linear Algebra and Its Applications. 38, C, p. 65-72 8 p.

Research output: Contribution to journal › Article › peer-review

Open Access

1980

EFFICIENT ALGORITHMS FOR A SELECTION PROBLEM WITH NESTED CONSTRAINTS AND ITS APPLICATION TO A PRODUCTION-SALES PLANNING MODEL.

Tamir, A., 1980, In: SIAM Journal on Control and Optimization. 18, 3, p. 282-287 6 p.

Research output: Contribution to journal › Article › peer-review

11 Scopus citations

The relationship between job design, human behaviour and system response

Globerson, S. & Tamir, A., 1980, In: International Journal of Production Research. 18, 3, p. 391-400 10 p.

Research output: Contribution to journal › Article › peer-review

14 Scopus citations

The use of jacobi's lemma in unimodularity theory

Kress, M. & Tamir, A., Dec 1980, In: Mathematical Programming. 18, 1, p. 344-348 5 p.

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

1979

Cyclic permutations and nearly symmetric integer vectors

Felzenbaum, A. & Tamir, A., Oct 1979, In: Linear Algebra and Its Applications. 27, C, p. 159-166 8 p.

Research output: Contribution to journal › Article › peer-review

Open Access

Arie Tamir

Research output

Search results