Abstract
In this paper, we are interested in Buy-at-Bulk Facility Location problem which arises in network design. The problem has been mainly studied from approximation algorithms perspective, and to the best of our knowledge, only [7] has developed an exact algorithm for the problem. In this work, we address the problem from a polyhedral point of view. First, we give an integer programming formulation which, contrarily to the those in previous works, does not use flow or path variables. Then, we investigate the structure of the polyhedron associated with this formulation and introduce several classes of valid inequalities which defines facets of the polyhedron.
Author supplied keywords
Cite
CITATION STYLE
Soraya, C., & Diarrassouba, I. (2020). A polyhedral study for the buy-at-bulk facility location problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12176 LNCS, pp. 42–53). Springer. https://doi.org/10.1007/978-3-030-53262-8_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
