Paper Info
Title
Lower bounds for the two-stage uncapacitated facility location problem
Abstract
In the two-stage uncapacitated facility location problem, a set of customers is served from a set of depots which receives the product from a set of plants. If a plant or depot serves a product, a fixed cost must be paid, and there are different transportation costs between plants and depots, and depots and customers. The objective is to locate plants and depots, given both sets of potential locations, such that each customer is served and the total cost is as minimal as possible. In this paper, we present a mixed integer formulation based on twice-indexed transportation variables, and perform an analysis of several Lagrangian relaxations which are obtained from it, trying to determine good lower bounds on its optimal value. Computational results are also presented which support the theoretical potential of one of the relaxations.
Year
DOI
Venue
2007
10.1016/j.ejor.2005.04.052
European Journal of Operational Research
Keywords
Field
DocType
Integer programming,Discrete location,Lagrangian relaxation
Integer,Mathematical optimization,Upper and lower bounds,Lagrange multiplier,Fixed cost,Facility location problem,Integer programming,Lagrangian relaxation,Total cost,Mathematics,Operations management
Journal
Volume
Issue
ISSN
179
3
0377-2217
Citations 
PageRank 
References 
15
0.86
3
Authors
1
Name
Order
Citations
PageRank
Alfredo Marín145332.98