Tamir A.

A. Tamir

Information about the author A. Tamir will soon be added to the site.
Found 13 papers in total
The bi-criteria doubly weighted center-median path problem on a tree
2006
Given a tree network T with n nodes, let 𝒫 L be the subset of all discrete paths...
A framework for demand point and solution space aggregation analysis for location models
2004
Many location problems can be formulated as minimizing some location objective...
Exploiting self-cancelling demand point aggregation error for some planar rectilinear median location problems
2003
When solving location problems in practice it is quite common to aggregate demand...
Least majorized elements and generalized polymatroids
1995
We prove that a bounded generalized polymatroid has a least weakly submajorized...
Worst-case incremental analysis for a class of p-facility location problems
2002
We consider a rather large class of p -facility location models including the p...
An O(pn2) algorithm for the p-median and related problems on tree graphs
1996
We improve the complexity bound of the p-median problem on trees by showing that the...
Locating service centers with precedence constraints
1993
Isotonic regression models have been used extensively with various objective...
On the core of network synthesis games
1991
The paper uses polynomial formulations to show that several rational and discrete...
Improved complexity bounds for location problems on the real line
1991
In this note the authors apply recent results in dynamic programming to improve the...
Algebraic optimization: The Fermat-Weber location problem
1990
The Fermat-Weber location problem is to find a point in ℝ n that minimizes the...
Open questions concerning Weiszfeld’s algorithm for the Fermat-Weber location problem
1989
The Fermat-Weber location problem is to find a point in ℝ n that minimizes the...
Equivalent mathematical programming formulations of monotonic tree network location problems
1989
The authors consider the optimization problem of locating several new facilities on a...
Maximizing classes of two-parameter objectives over matroids
1989
Let M =( N ,ℱ) be a matroid. Suppose that each element i in N is associated with...
Papers per page: