Tamir Arie

Arie Tamir

Information about the author Arie Tamir will soon be added to the site.
Found 32 papers in total
Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs
Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs
2013
We consider a common scenario in competitive location, where two competitors...
An optimal O(n log n) algorithm for finding an enclosing planar rectilinear annulus of minimum width
An optimal O(n log n) algorithm for finding an enclosing planar rectilinear annulus of minimum width
2009
Given a set P of n points in the plane, we consider the problem of finding a planar...
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
2009
We consider the bounded integer knapsack problem (BKP) max Σ j = 1 n p j x j ,...
Minimum Lk path partitioning–An illustration of the Monge property
Minimum Lk path partitioning–An illustration of the Monge property
2008
We investigate the problem of cutting a given sequence of positive real numbers into p...
Optimal location with equitable loads
Optimal location with equitable loads
2009
The problem considered in this paper is to find p locations for p facilities such that...
Minimum Lk path partitioning – An illustration of the Monge property
Minimum Lk path partitioning – An illustration of the Monge property
2008
We investigate the problem of cutting a given sequence of positive real numbers into p...
Locating two obnoxious facilities using the weighted maximin criterion
Locating two obnoxious facilities using the weighted maximin criterion
2006
Given are a finite set of points P and a compact polygonal set S in R 2 . The problem...
One-way and round-trip center location problems
One-way and round-trip center location problems
2005
In the classical p -center problem there is a set V of points (customers) in some...
An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks
An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks
2004
In a recent article Averbakh and Berman present an O(p 3  + n 2 ) serial...
Sorting weighted distances with applications to objective function evaluations in single facility location problem
Sorting weighted distances with applications to objective function evaluations in single facility location problem
2004
We consider single facility location problems on rectilinear spaces and spaces induced...
A polynomial algorithm for the p-centdian problem on a tree
A polynomial algorithm for the p-centdian problem on a tree
1998
The most common problems studied in network location theory are the p -median and the...
On the location of a tree-shaped facility
On the location of a tree-shaped facility
1996
This paper considers the problem of locating a central facility on a tree network. The...
Aggregation error bounds for a class of location models
Aggregation error bounds for a class of location models
2000
Many location models involve distances and demand points in their objective function....
Structured p-facility location problems on the line solvable in polynomial time
Structured p-facility location problems on the line solvable in polynomial time
1997
In this paper we give an O ( pn 2 ) algorithm for solving the p -facility location...
A p-center grid-positioning aggregation procedure
A p-center grid-positioning aggregation procedure
1999
We present an algorithm for aggregating p -center demand points such that the...
Approximation algorithms for maximum dispersion
Approximation algorithms for maximum dispersion
1997
We describe approximation algorithms with bounded performance guarantees for the...
The single facility location problem with minimum distance constraints
The single facility location problem with minimum distance constraints
1997
We consider the problem of locating a single facility (server) in the plane, where the...
A maximum b-matching problem arising from median location models with applications to the roommates problem
A maximum b-matching problem arising from median location models with applications to the roommates problem
1998
We consider maximum b -matching problems where the nodes of the graph represent points...
An O(pn2) algorithm of the p-median and related problems on tree graphs
An O(pn2) algorithm of 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...
Capacitated location problems on a line
Capacitated location problems on a line
1996
This paper examines capacitated facility location problems on a straight line. To...
Capacitated location problems on a line
Capacitated location problems on a line
1996
This paper examines capacitated facility loction problems on a straight line. To serve...
Capacitated location problem on a line
Capacitated location problem on a line
1996
This paper examines capacitated facility location problems on a straight line. To...
A distance constrained p-facility location problem on the real line
A distance constrained p-facility location problem on the real line
1994
Let V={v 1 ,...,v n } be a set of n points on the real line (existing facilities). The...
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
1993
The problem of integer programming in bounded variables, over constraints with no more...
Papers per page: