A note on node packing polytopes on hypergraphs
From MaRDI portal
Publication:790042
DOI10.1016/0167-6377(83)90032-9zbMath0533.90060MaRDI QIDQ790042
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
hypergraph; combinatorial optimization; facial structure; fat graph; canonical facets; convex hull of integer solutions; node packing polytope
90C10: Integer programming
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
52Bxx: Polytopes and polyhedra
Related Items
Discrete relaxations of combinatorial programs, A generalization of antiwebs to independence systems and their canonical facets, Facets and lifting procedures for the set covering polytope
Cites Work