New facets for the two-stage uncapacitated facility location polytope

Authors:
Mercedes Landete;Alfredo Marín
Affiliations:
Departamento de Estadística y Matemática Aplicada, Centro de Investigación Operativa, Universidad Miguel Hernández, Elche, Spain;Departamento de Estadística e Investigación Operativa, Facultad de Matemáticas, Campus de Espinardo, Universidad de Murcia, Murcia, Spain
Venue:
Computational Optimization and Applications
Year:
2009

Citing 8
Cited 2

Compositions of Graphs and Polyhedra II: Stable Sets

SIAM Journal on Discrete Mathematics
Wheel inequalities for stable set polytopes

Mathematical Programming: Series A and B
A branch-and-bound algorithm for the transportation problem with location of p transshipment points

Computers and Operations Research
A parallel branch-and-bound algorithm for multicommodity location with balancing requirements

Computers and Operations Research
A multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution

Computers and Operations Research
Facet Obtaining Procedures for Set Packing Problems

SIAM Journal on Discrete Mathematics
New facets for the set packing polytope

Operations Research Letters
An approximation algorithm for the maximization version of the two level uncapacitated facility location problem

Operations Research Letters

Semi-Lagrangian relaxation applied to the uncapacitated facility location problem

Computational Optimization and Applications
Solving the two-stage capacitated facility location problem by the lagrangian heuristic

ICCL'12 Proceedings of the Third international conference on Computational Logistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The two-stage uncapacitated facility location problem is considered. This problem involves a system providing a choice of depots and plants, each with an associated location cost, and a set of demand points which must be supplied, in such a way that the total cost is minimized. The formulations used until now to approach the problem were symmetric in plants and depots. In this paper the asymmetry inherent to the problem is taken into account to enforce the formulation which can be seen like a set packing problem and new facet defining inequalities for the convex hull of the feasible solutions are obtained. A computational study is carried out which illustrates the interest of the new facets. A new family of facets recently developed, termed lifted fans, is tested with success.