Abstract
In this paper we examine the Uncapacitated Facility Location Problem (UFLP) with a special structure of the objective function coefficients. For each customer the set of potential locations can be partitioned into subsets such that the objective function coefficients in each are identical. This structure exists in many applications, including the Maximum Cover Location Problem. For the problems possessing this structure, we develop a new integer programming formulation that has all the desirable properties of the standard formulation, but with substantially smaller dimensionality, leading to significant improvement in computational times. While our formulation applies to any instance of the UFLP, the reduction in dimensionality depends on the degree to which this special structure is present.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
