Tamir Arie

Arie Tamir

Information about the author Arie Tamir will soon be added to the site.
Found 32 papers in total
The least element property of center location on tree networks with applications to distance and precedence constrained problems
The least element property of center location on tree networks with applications to distance and precedence constrained problems
1993
In the classical p- center location model on a network there is a set of customers,...
On the core of cost allocation games defined on location problems
On the core of cost allocation games defined on location problems
1993
The literature on location theory has dealt mainly with finding ‘optimal’...
Complexity results for the p-median problem with mutual communication
Complexity results for the p-median problem with mutual communication
1993
The p- median problem with mutual communication is defined as follows: Let G=(V,E) be...
Linear time algorithms for some separable quadratic programming problems
Linear time algorithms for some separable quadratic programming problems
1993
A large class of separable quadratic programming problems is presented. The problems...
A unifying location model on tree graphs based on submodularity properties
A unifying location model on tree graphs based on submodularity properties
1993
Let ℱ be the collection of nonempty subtrees of a given tree T. Each subtree is...
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
1993
The authors present strongly polynomial algorithms to find rational and integer flow...
On the core of a traveling salesman cost allocation game
On the core of a traveling salesman cost allocation game
1989
Let G=(V,E) be a connected undirected graph with positive edge lengths. Let...
Improved complexity bounds for center location problems on networks by using dynamic data structures
Improved complexity bounds for center location problems on networks by using dynamic data structures
1988
Several center location problems on general networks and even on tree networks are...
Papers per page: