Berman Oded

Oded Berman

Information about the author Oded Berman will soon be added to the site.
Found 97 papers in total
The gradual covering decay location problem on a network
The gradual covering decay location problem on a network
2003
In covering problems it is assumed that there is a critical distance within which the...
A queueing control model for retail services having back room operations and cross-trained workers
A queueing control model for retail services having back room operations and cross-trained workers
2004
Many retail service facilities have both front room and back room operations, The...
A probabilistic minimax location problem on the plane
A probabilistic minimax location problem on the plane
2003
In this paper we consider the weighted minimax (1-center) location problem in the...
Locating service facilities whose reliability is distance dependent
Locating service facilities whose reliability is distance dependent
2003
We consider the problem where there is a probability, depending on the distance from...
An improved algorithm for the minmax regret median problem on a tree
An improved algorithm for the minmax regret median problem on a tree
2003
We consider the 1-median problem with uncertain weights for nodes. Specifically, for...
Parallel NC-algorithms for multifacility location problems with mutual communication and their applications
Parallel NC-algorithms for multifacility location problems with mutual communication and their applications
2002
The generic problem studied is to locate p distinguishable facilities on a tree to...
Locating multiple competitive facilities: Spatial interaction models with variable expenditures
Locating multiple competitive facilities: Spatial interaction models with variable expenditures
2002
We develop a new framework for location of competitive facilities by introducing...
Minmax p-traveling salesmen location problems on a tree
Minmax p-traveling salesmen location problems on a tree
2002
Suppose that p traveling salesmen must visit together all points of a tree, and the...
Dynamic order replenishment policy in Internet-based supply chains
Dynamic order replenishment policy in Internet-based supply chains
2001
We consider a problem of dynamic replenishment of parts in the supply chain consisting...
The collection depots location problem on networks
The collection depots location problem on networks
2002
In this paper we investigate the collection depots location problem on a network. A...
Deliveries in an inventory/routing problem using stochastic dynamic programming
Deliveries in an inventory/routing problem using stochastic dynamic programming
2001
An industrial gases tanker vehicle visits n customers on a tour, with a possible ( n...
Optimal service rates of a service facility with perishable inventory items
Optimal service rates of a service facility with perishable inventory items
2002
In this paper we optimally control service rates for an inventory system of service...
Deliveries in an inventory/routing problem using stochastic dynamic programming
Deliveries in an inventory/routing problem using stochastic dynamic programming
2001
An industrial gases tanker vehicle visits n customers on a tour, with a possible...
Two control policies for stochastic economic order quantity-type models
Two control policies for stochastic economic order quantity-type models
2001
We present the production version of two EOQ-type models in heavy traffic. The output...
The generalized maximal covering location problem
The generalized maximal covering location problem
2002
We consider a generalization of the maximal cover location problem which allows for...
Location problems with grouped structure of demand: Complexity and algorithms
Location problems with grouped structure of demand: Complexity and algorithms
1998
We study generalizations of classical multifacility location problems, where...
Minimum covering criterion for obnoxious facility location on a network
Minimum covering criterion for obnoxious facility location on a network
1996
The objective of this article was to find a location of a new facility on a network so...
Routing and location on a network with hazardous threats
Routing and location on a network with hazardous threats
2000
The aim of this paper is to minimise the impact of hazards located on or near a...
Minmax regret median location on a network under uncertainty
Minmax regret median location on a network under uncertainty
2000
We consider the 1-median problem on a network with uncertain weights of nodes....
A note on the location of an obnoxious facility on a network
A note on the location of an obnoxious facility on a network
2000
We find the best location for an obnoxious facility on a network such that the least...
Algorithms for the robust 1‐center problem on a tree
Algorithms for the robust 1‐center problem on a tree
2000
We consider the weighted 1‐center problem on a network with uncertainty in node...
A simple heuristic for m-machine flow-shop and its applications in routing–scheduling problems
A simple heuristic for m-machine flow-shop and its applications in routing–scheduling problems
1999
We consider the routing–scheduling version of the flow-shop problem, where n...
Stochastic models for inventory management at service facilities
Stochastic models for inventory management at service facilities
1999
We consider a facility that provides service to customers using items of inventory....
Parallel complexity of additive location problems
Parallel complexity of additive location problems
1999
Parallel NC-algorithms for a general class of multifacility location problems on a...
Papers per page: