On the Two-Level Uncapacitated Facility Location Problem
From MaRDI portal
Publication:5690266
DOI10.1287/ijoc.8.3.289zbMath0863.90102MaRDI QIDQ5690266
Martine Labbé, Maurice Queyranne, Karen Aardal, Janny M. Y. Leung
Publication date: 10 June 1997
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/00261c90ee9ae97584aba27f974f0b8863d6d0a7
cutting planes; valid inequalities; facets; LP-relaxation; two-level uncapacitated facility location; multicommodity flow formulations; single-commodity fixed-charge network flow problem
90C10: Integer programming
90B10: Deterministic network models in operations research
90B80: Discrete location and assignment
Related Items
Extreme points of discrete location polyhedra, Adapting polyhedral properties from facility to hub location problems, Facility location models for distribution system design, A review of hierarchical facility location models, Lower and upper bounds for a capacitated plant location problem with multicommodity flow, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, An approximation algorithm for the maximization version of the two level uncapacitated facility location problem, A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem, A note on the maximization version of the multi-level facility location problem, Approximating the two-level facility location problem via a quasi-greedy approach, New facets for the two-stage uncapacitated facility location polytope
