A note on node packing polytopes on hypergraphs

DOI10.1016/0167-6377(83)90032-9zbMath0533.90060OpenAlexW2067846821MaRDI QIDQ790042

Yasuki Sekiguchi

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

zbMATH Keywords

hypergraphcombinatorial optimizationfacial structurefat graphcanonical facetsconvex hull of integer solutionsnode packing polytope

Mathematics Subject Classification ID

Integer programming (90C10) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Polytopes and polyhedra (52Bxx)

Related Items

A generalization of antiwebs to independence systems and their canonical facets ⋮ Facets and lifting procedures for the set covering polytope ⋮ Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model ⋮ Discrete relaxations of combinatorial programs

Cites Work

• Unnamed Item
• A class of facet producing graphs for vertex packing polyhedra
• On certain polytopes associated with graphs
• Technical Note—A Note on Zero-One Programming