A note on node packing polytopes on hypergraphs
From MaRDI portal
Recommendations
Cites work
Cited in
(11)- Transitive Packing: A Unifying Concept in Combinatorial Optimization
- Solving a multigroup mixed-integer programming-based constrained discrimination model
- A hypergraph version of a graph packing theorem by Bollobás and Eldridge
- New facets for the set packing polytope
- Using hyperstars to create facial-defining inequalities of general binary integer programs
- Facets and lifting procedures for the set covering polytope
- Facet Obtaining Procedures for Set Packing Problems
- Discrete relaxations of combinatorial programs
- Transitive packing
- A generalization of antiwebs to independence systems and their canonical facets
- A note on packing of two copies of a hypergraph
This page was built for publication: A note on node packing polytopes on hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790042)