Berman Oded

Oded Berman

Information about the author Oded Berman will soon be added to the site.
Found 97 papers in total
Algorithms for path medi-centers of a tree
Algorithms for path medi-centers of a tree
1999
We consider the problem of finding an optimal location of a path on a tree, using...
Optimization models for recovery block schemes
Optimization models for recovery block schemes
1999
This paper presents optimization models for a fault tolerant software by selecting a...
Optimization models for complex recovery block schemes
Optimization models for complex recovery block schemes
1999
In this paper we consider three complex recovery block schemes: (1) nested recovery...
The plant location problem with demand-dependent setup costs and centalized allocation
The plant location problem with demand-dependent setup costs and centalized allocation
1998
Suppose that customers are situated at the nodes of a transportation network, and a...
Flow intercepting spatial interaction model: A new approach to optimal location of competitive facilities
Flow intercepting spatial interaction model: A new approach to optimal location of competitive facilities
1998
In this paper we propose a flexible new model for the location of competitive...
Minimax regret p-center location on a network with demand uncertainty
Minimax regret p-center location on a network with demand uncertainty
1997
We consider the weighted p -center problem on a transportation network with uncertain...
Optimal software implementation considering reliability and cost
Optimal software implementation considering reliability and cost
1998
It is becoming increasingly difficult to create software products that simultaneously...
Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
1996
In the paper we consider the problem of locating flow-capturing units (facilities) on...
Bottleneck Steiner subnetwork problems with k-connectivity constraints
Bottleneck Steiner subnetwork problems with k-connectivity constraints
1996
The objective is to connect a given set of terminal nodes of a network by a subnetwork...
Locating discretionary service facilities, II: Maximizing market size, minimizing inconvenience
Locating discretionary service facilities, II: Maximizing market size, minimizing inconvenience
1995
Discretionary service facilities are providers of products and/or services that are...
Scheduling workforce and workflow in a high volume factory
Scheduling workforce and workflow in a high volume factory
1997
We define a high volume factory to be a connected network of workstations, at which...
Determining optimal pool size of a temporary call-in work force
Determining optimal pool size of a temporary call-in work force
1994
This paper is one in a series that introduces concepts of JUST-IN-TIME-PERSONNEL....
Routing two-machine flowshop problems on networks with special structure
Routing two-machine flowshop problems on networks with special structure
1996
The authors consider a version of the routing two-machine flowshop problem, where n...
Bottleneck Steiner subnetwork problems with k-connectivity constraints
Bottleneck Steiner subnetwork problems with k-connectivity constraints
1996
The objective is to connect a given set of terminal nodes of a network by a subnetwork...
The p maximal cover-p partial center problem on networks
The p maximal cover-p partial center problem on networks
1994
The p maximal cover problem is to find a set of locations for p facilities so as to...
Categorized bottleneck-Minisum path problems on networks
Categorized bottleneck-Minisum path problems on networks
1994
The authors introduce two path problems on a network, where edges of the network are...
Locating flow-intercepting facilities: New approaches and results
Locating flow-intercepting facilities: New approaches and results
1995
The problem of locating flow-intercepting facilities on a network with probabilistic...
Models for planning capacity expansion of convenience stores under uncertain demand and the value of information
Models for planning capacity expansion of convenience stores under uncertain demand and the value of information
1995
Several stochastic optimization models for planning capacity expansion for convenience...
Probabilistic a priori routing-location problems
Probabilistic a priori routing-location problems
1994
In many routing-location models customers located at nodes of a network generate calls...
The capacity expansion problem in the service industry
The capacity expansion problem in the service industry
1994
Consider the problem of determining capacity expansions within a service industry...
A stochastic optimization model for planning capacity expansion in a service industry under uncertain demand
A stochastic optimization model for planning capacity expansion in a service industry under uncertain demand
1994
A stochastic optimization model for capacity expansion for a service industry that...
Optimal location of discretionary service facilities
Optimal location of discretionary service facilities
1992
Automatic teller machines and gasoline service stations are two examples of a growing...
Improving the location of minisum facilities through network modification
Improving the location of minisum facilities through network modification
1993
In this paper, the authors consider the problem of how the transportation network can...
Medi-centre location problems
Medi-centre location problems
1991
In this paper the authors consider two medi-centre location problems. One is the m...
Papers per page: