New facets for the set packing polytope

Authors:
LáZaro CáNovas;Mercedes Landete;Alfredo MarıN
Affiliations:
Departamento de Estadıstica e Investigación Operativa, Facultad de Mátematicas, Universidad de Murcia, Campus de Espinardo, 30071 Murcia, Spain;Centro de Investigación Operativa, Universidad Miguel Hernández, Spain;Departamento de Estadıstica e Investigación Operativa, Facultad de Mátematicas, Universidad de Murcia, Campus de Espinardo, 30071 Murcia, Spain
Venue:
Operations Research Letters
Year:
2000

Citing 3
Cited 5

Compositions of Graphs and Polyhedra II: Stable Sets

SIAM Journal on Discrete Mathematics
Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor

SIAM Journal on Discrete Mathematics
Wheel inequalities for stable set polytopes

Mathematical Programming: Series A and B

On the facets of the simple plant location packing polytope

Discrete Applied Mathematics - Workshop on discrete optimization DO'99, contributions to discrete optimization
Adapting polyhedral properties from facility to hub location problems

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
A branch-and-cut algorithm for the pallet loading problem

Computers and Operations Research
A branch-and-cut algorithm for the Winner Determination Problem

Decision Support Systems
New facets for the two-stage uncapacitated facility location polytope

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a family of graphs, named grilles, and a facet of the set packing polytope associated with a grille. The proof is based on a new facet generating procedure which is valid in a wider context. We also obtain new facets for the simple plant location polytope.