Facet Obtaining Procedures for Set Packing Problems

DOI10.1137/S0895480100366786zbMath1029.05131OpenAlexW2042502906MaRDI QIDQ4443075

Alfredo Marín, Lázaro Cánovas, Mercedes Landete

Publication date: 8 January 2004

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480100366786

zbMATH Keywords

stable setindependent setset packingfacet

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Structural characterization of families of graphs (05C75)

Related Items (13)

Solving the set packing problem via a maximum weighted independent set heuristic ⋮ Strengthening the reliability fixed-charge location model using clique constraints ⋮ New facets for the two-stage uncapacitated facility location polytope ⋮ Alternative formulations for the set packing problem and their application to the winner determination problem ⋮ New variants of the simple plant location problem and applications ⋮ On the facets of lift-and-project relaxations under graph operations ⋮ Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience ⋮ New facets for the set packing polytope ⋮ Stochastic set packing problem ⋮ A polyhedral study on 0-1 knapsack problems with set packing constraints ⋮ A New Facet Generating Procedure for the Stable Set Polytope ⋮ A new lifting theorem for vertex packing ⋮ On the facets of the simple plant location packing polytope

This page was built for publication: Facet Obtaining Procedures for Set Packing Problems