Within the last year
Within the past 3 years
1 - 9 of 9 articles
This paper considers a class of Capacitated Facility Location Problems in which customer demands are stochastic. The problem is formulated as a stochastic integer linear program, with first stage binary variables and second stage continuous variables. It is solved to optimality by means of a...
The multimedian problem is to locate “distinguishable” new facilities on a connected network G so as to minimize a total cost, which is a sum of costs directly proportional to (a) network distances between new facilities and existing facilities at vertex locations and (b) distances between...
In many location models, it is assumed that customers select the facility they will patronize based on the distance to that facility, or perhaps on a function of distances between the customer and the different available facilities. We consider a location problem in which customers select a...
This paper considers the problem of locating the home base of a traveling server on a network. Calls for service arrive solely at nodes via independent, time-homogeneous Poisson processes. Calls finding the server busy enter a finite capacity queue which is depleted in a First-Come-First-Served...
In this note, we discuss routing and location-routing delivery men problems on a path. The objective of the delivery men problem is to find service tours so as to minimize the total waiting time of all customers. We present an O ( n 2 ) time algorithm for the location-routing problem with a...
A generic multifacility location problem is considered which subsumes, as special cases, several NP-hard location problems that have appeared in literature. A unified algorithm is presented which solves the generic problem in polynomial time when problem structure, as defined by interactions...
The uncapacitated p -center problem has been shown to be NP-Hard for the case of a general network, yet polynomial algorithms exist for the case of a tree network. We extend the results for trees to include the case where each center can serve a limited number of customers and show that the...
In a recent paper, Z. Drezner and A. J. Goldman address the problem of determining the smallest set among those containing at least one optimal solution to every Weber problem based on a set of demand points in the plane. In the case of arbitrary mixed gauges (i.e., possibly nonsymmetric norms),...
Read and print from thousands of top scholarly journals.
Sign up with Facebook
Sign up with Google
Already have an account? Log in
Save this article to read later. You can see your Read Later on your DeepDyve homepage.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.