Facet Obtaining Procedures for Set Packing Problems
From MaRDI portal
Recommendations
Cited in
(16)- Facets for node packing
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
- A class of web-based facets for the generalized vertex packing problem
- A polyhedral study on 0-1 knapsack problems with set packing constraints
- On the facets of the simple plant location packing polytope
- A new lifting theorem for vertex packing
- On the facets of lift-and-project relaxations under graph operations
- New facets for the two-stage uncapacitated facility location polytope
- A new facet generating procedure for the stable set polytope
- Strengthening the reliability fixed-charge location model using clique constraints
- Alternative formulations for the set packing problem and their application to the winner determination problem
- New facets for the set packing polytope
- New variants of the simple plant location problem and applications
- Stochastic set packing problem
- A note on node packing polytopes on hypergraphs
- Solving the set packing problem via a maximum weighted independent set heuristic
This page was built for publication: Facet Obtaining Procedures for Set Packing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4443075)