Anti-blocking polyhedra
From MaRDI portal
Publication:2549326
DOI10.1016/0095-8956(72)90032-9zbMath0227.05015OpenAlexW2072848654MaRDI QIDQ2549326
Publication date: 1972
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(72)90032-9
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of packing and covering (05B40)
Related Items
Determining the number of internal stability of a graph, On the Chvátal-rank of Antiwebs, Semiantichains and Unichain Coverings in Direct Products of Partial Orders, Geometric inequalities for anti-blocking bodies, Polyhedral proof methods in combinatorial optimization, An algorithm for the maximum internally stable set in a weighted graph, Integer round-up property for the chromatic number of some \(h\)-perfect graphs, The facets and the symmetries of the approval-voting polytope, Efficient algorithms for minimum weighted colouring of some classes of perfect graphs, Synthesis of directed multicommodity flow networks, Lift-and-project ranks and antiblocker duality, Non-interfering network flows, Extremal problems for finite sets and convex hulls---a survey, On perfect \(0,\pm 1\) matrices, Combinatorial differential algebra of \(x^p\), An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem, Fractional and integral colourings, Cardinality-restricted chains and antichains in partially ordered sets, On perfect graphs and polyhedra with (0, 1)-valued extreme points, Some properties of minimal imperfect graphs, Minmax relations for cyclically ordered digraphs, Graphical properties related to minimal imperfection, Zur Theorie der perfekten Graphen, Polyhedral Combinatorics in Combinatorial Optimization, $t$-Perfection in $P_5$-Free Graphs, Unconditional reflexive polytopes, Alternatives for testing total dual integrality, Discrete extremal problems, On claw-free \(t\)-perfect graphs, Perfect graphs, kernels, and cores of cooperative games, Balanced matrices, Blocking and anti-blocking pairs of polyhedra, A polyhedral study of the semi-continuous knapsack problem, Blocking versus nonblocking interprocess communication: A note on the effect on concurrency, On stable set polyhedra for K//(1,3)free graphs, Vertex packings: Structural properties and algorithms, Fair cost allocations under conflicts - a game-theoretic point of view -, Kőnig's edge-colouring theorem for all graphs, On circular-perfect graphs: a survey, On the Chvátal rank of linear relaxations of the stable set polytope, 2-Matchings and 2-covers of hypergraphs, Coflow polyhedra, On the mixed set covering, packing and partitioning polytope, Combinatorial characterization of read-once formulae, Independence-domination duality, A note on kernels and Sperner's Lemma, A polyhedral approach to the stability of a family of coalitions, Energy of convex sets, shortest paths, and resistance, Unnamed Item, Exploring the relationship between max-cut and stable set relaxations, Some remarks on Hajós' conjecture, A class of facet producing graphs for vertex packing polyhedra, Blocking pairs of polyhedra arising from network flows, Line perfect graphs, Some partitions associated with a partially ordered set, Strong IP formulations need large coefficients, Normal hypergraphs and the perfect graph conjecture. (Reprint), Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint), On formal fractions associated with the symmetric groups, On packing and covering polyhedra in infinite dimensions, Almost integral polyhedra related to certain combinatorial optimization problems, Computing the clique number of \(a\)-perfect graphs in polynomial time, Critical perfect graphs and perfect 3-chromatic graphs, The matroids with the max-flow min-cut property, A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant, Blocking, antiblocking, and pairs of matroids and polymatroids, The \(h^\ast\)-polynomials of locally anti-blocking lattice polytopes and their \(\gamma\)-positivity, Connected and alternating vectors: Polyhedra and algorithms, Norms and perfect graphs, A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles, A min-max relation for the partial q-colourings of a graph. II: Box perfection, On totally dual integral systems, Normal hypergraphs and the perfect graph conjecture, Edmonds polytopes and a hierarchy of combinatorial problems, The strong perfect graph conjecture: 40 years of attempts, and its resolution, Finite checkability for integer rounding properties in combinatorial programming problems, On the use of penumbras in blocking and antiblocking theory, Integer Rounding for Polymatroid and Branching Optimization Problems, On a geometric property of perfect graphs, Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming, On the integrality of an extreme solution to pluperfect graph and balanced systems, Path-closed sets, Properties of vertex packing and independence system polyhedra, Fractionally colouring total graphs, Packing rooted directed cuts in a weighted directed graph, Some sequences associated with combinatorial structures, Blocking and antiblocking sets, Computing low-capacity 0–1 knapsack polytopes
Cites Work
