A note on node packing polytopes on hypergraphs
DOI10.1016/0167-6377(83)90032-9zbMATH Open0533.90060OpenAlexW2067846821MaRDI QIDQ790042FDOQ790042
Publication date: 1983
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(83)90032-9
Recommendations
combinatorial optimizationhypergraphfacial structurefat graphcanonical facetsconvex hull of integer solutionsnode packing polytope
Integer programming (90C10) Polytopes and polyhedra (52Bxx) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (9)
- A note on packing of two copies of a hypergraph
- Discrete relaxations of combinatorial programs
- A generalization of antiwebs to independence systems and their canonical facets
- A hypergraph version of a graph packing theorem by Bollobás and Eldridge
- Facet Obtaining Procedures for Set Packing Problems
- Facets and lifting procedures for the set covering polytope
- Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model
- Transitive Packing: A Unifying Concept in Combinatorial Optimization
- New facets for the set packing polytope
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)