Packing Problems and Hypergraph Theory: A Survey

DOI10.1016/S0167-5060(08)70816-1zbMath0425.05017OpenAlexW1204604820MaRDI QIDQ3859781

Claude Berge

Publication date: 1979

Published in: Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70816-1

zbMATH Keywords

combinatoricslinear programminginteger programmingtransversalsmatchingsfractional graph theoryfractional transversal number

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Integer programming (90C10) Linear programming (90C05) Hypergraphs (05C65) Combinatorial aspects of packing and covering (05B40)

Related Items

Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance ⋮ The skiving stock problem and its relation to hypergraph matchings ⋮ Maximal irredundant functions ⋮ Maximum degree and fractional matchings in uniform hypergraphs ⋮ On the fractional matching polytope of a hypergraph ⋮ Matchings and covers in hypergraphs ⋮ On the computational complexity of upper fractional domination ⋮ A recognition problem in converting linear programming to network flow models ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems) ⋮ Vertices Belonging to All or to No Maximum Stable Sets of a Graph