A Branch-and-Cut Algorithm for a Generalization of the Uncapacitated Facility Location Problem (1995)
| Venue: | TOP |
| Citations: | 8 - 2 self |
BibTeX
@ARTICLE{Caprara95abranch-and-cut,
author = {Alberto Caprara and Juan José Salazar González},
title = {A Branch-and-Cut Algorithm for a Generalization of the Uncapacitated Facility Location Problem},
journal = {TOP},
year = {1995},
volume = {4},
pages = {135--163}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We introduce a generalization of the well-known Uncapacitated Facility Location Problem, in which clients can be served not only by single facilities but also by sets of facilities. The problem, called Generalized Uncapacitated Facility Location Problem (GUFLP), was inspired by the Index Selection Problem in physical database design. We formulate GUFLP as a Set Packing Problem, showing that our model contains all the clique inequalities (in polynomial number). Moreover, we describe an exact separation procedure for odd-hole inequalities, based on the particular structure of the problem. These results are used within a branch-and-cut algorithm for the exact solution of GUFLP. Computational results on two different classes of test problems are given.
