Covers and packings in a family of sets

DOI10.1090/S0002-9904-1962-10791-5zbMath0106.24201WikidataQ92417567 ScholiaQ92417567MaRDI QIDQ3292586

Jack Edmonds

Publication date: 1962

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

combinatorics

Related Items

Determining the number of internal stability of a graph, Semiantichains and Unichain Coverings in Direct Products of Partial Orders, Robust min-max regret covering problems, Solving the anti-covering location problem using Lagrangian relaxation, Graph theoretic relaxations of set covering and set partitioning problems, Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty, Vertex packings: Structural properties and algorithms, An efficient algorithm for minimumk-covers in weighted graphs, Transitive packing, The complexity of lifted inequalities for the knapsack problem, Covers, matchings and odd cycles of a graph, On the facial structure of set packing polyhedra, Electronic circuit diagnostic expert systems - a survey, Maximum internally stable sets of a graph, A surprising permanence of old motivations (a not-so-rigid story), On cliques associated to 3-set packing problems, Properties of vertex packing and independence system polyhedra, The maximum clique problem, A formal model of diagnostic inference. I. Problem formulation and decomposition, A formal model of diagnostic inference. II. Algorithmic solution and application, Relaxed tours and path ejections for the traveling salesman problem

Cites Work

• Unnamed Item
• Algebraic Topological Methods for the Synthesis of Switching Systems. I
• TWO THEOREMS IN GRAPH THEORY
• An Algorithm for a Minimum Cover of a Graph
• Widths and Heights of (0,1) -Matrices