ISSN:
1572-9338
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Economics
Notes:
Abstract A family of two‐stage location problems is considered. These problems involve a systemproviding a choice of depots andyor plants, each with an associated location cost, and a setof demand points which must be supplied, in such a way that the total cost is minimized. Byusing Lagrangian relaxation, lower bounds and heuristic solutions are obtained for two kindsof formulation involving two or three indexes for each transportation variable. The goodnessof both formulations is compared by means of a computational study, and the results forseveral instances are presented.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1018998500803
Permalink