On the facets of the simple plant location packing polytope

Authors:
Lázaro Cánovas;Mercedes Landete;Alfredo Marín
Affiliations:
Departamento de Estadística e Investigación Operativa, Universidad de Murcia, Facultad de Matemáticas, Campus de Espinardo, 30071 Murcia, Spain;Centro de Investigación Operativa, Universidad Miguel Hernández, Spain;Departamento de Estadística e Investigación Operativa, Universidad de Murcia, Facultad de Matemáticas, Campus de Espinardo, 30071 Murcia, Spain
Venue:
Discrete Applied Mathematics - Workshop on discrete optimization DO'99, contributions to discrete optimization
Year:
2002

Citing 6
Cited 5

Capacitated facility location: valid inequalities and facets

Mathematics of Operations Research
Wheel inequalities for stable set polytopes

Mathematical Programming: Series A and B
Capacitated facility location: separation algorithms and computational experience

Mathematical Programming: Series A and B - Special issue on computational integer programming
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A family of facets for the uncapacitated p-median polytope

Operations Research Letters
New facets for the set packing polytope

Operations Research Letters

Adapting polyhedral properties from facility to hub location problems

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
A flexible model and efficient solution strategies for discrete location problems

Discrete Applied Mathematics
On the $p$-Median Polytope and the Intersection Property: Polyhedra and Algorithms

SIAM Journal on Discrete Mathematics
Semi-Lagrangian relaxation applied to the uncapacitated facility location problem

Computational Optimization and Applications
On the linear relaxation of the p-median problem

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce new classes of facet-defining inequalities for the polytope Ppd associated with the set packing formulation of the simple plant location problem (SPLP) with p plants and d destinations. The inequalities are obtained by identifying subgraphs of the intersection graph G(p,d) of SPLP that are facet-defining, and lifting their associated facets if it is necessary. To this end, we find subfamilies of previously known structured families of facet-defining graphs, like fans and wheels, inside G(p,d). We also characterize a class of facets of SPLP and summarize the previous polyhedral results on this problem.