Blocking and anti-blocking pairs of polyhedra

DOI10.1007/BF01584085zbMath0254.90054MaRDI QIDQ5668263

Publication date: 1971

Published in: Mathematical Programming (Search for Journal in Brave)

90C35: Programming involving graphs or networks

90C10: Integer programming

52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)

Related Items

Graphs with the Circuit Cover Property, Norms and perfect graphs, Dominants and submissives of matching polyhedra, Integral decomposition in polyhedra, Properties of vertex packing and independence system polyhedra, Packing rooted directed cuts in a weighted directed graph, Perfect zero–one matrices, Blocking and antiblocking sets, A note on the blocker of tours, Precoloring Extension III: Classes of Perfect Graphs, On the facial structure of set packing polyhedra, Balanced matrices, Two-commodity cut-packing problem, Energy of convex sets, shortest paths, and resistance, Two easy duality theorems for product partial orders, Lehman's forbidden minor characterization of ideal 0-1 matrices, The anti-join composition and polyhedra, On cuts and matchings in planar graphs, Cutting planes in integer and mixed integer programming, A min-max relation for the partial q-colourings of a graph. II: Box perfection, Total weak unimodularity: Testing and applications, A class of h-perfect graphs, On the integrality of an extreme solution to pluperfect graph and balanced systems, On some weakly bipartite graphs, Path-closed sets, Entropy splitting for antiblocking corners and perfect graphs, Fano colourings of cubic graphs and the Fulkerson conjecture, The complexity of recognizing linear systems with certain integrality properties, Polarity and the complexity of the shooting experiment, Families of dot-product snarks on orientable surfaces of low genus, On a geometric property of perfect graphs, Testing membership in matroid polyhedra, A new proof of a theorem of Harper on the Sperner-Erdős problem, Relaxations of vertex packing, Polyhedral proof methods in combinatorial optimization, A reduction procedure for coloring perfect \(K_ 4\)-free graphs, Edge-packings of graphs and network reliability, A generalization of Robacker's theorem, On the facial structure of the set covering polytope, On the spanning tree polyhedron, Perfect graphs are kernel solvable, Graphical properties related to minimal imperfection, Discrete extremal problems, Perfect graphs and norms, Integer flows and cycle covers, Separating from the dominant of the spanning tree polytope, A class of facet producing graphs for vertex packing polyhedra, A proof of Fulkerson's characterization of permutation matrices, Blocking pairs of polyhedra arising from network flows, Almost integral polyhedra related to certain combinatorial optimization problems, An unbounded matroid intersection polyhedron, Classification de certaines matrices 0-1, Critical perfect graphs and perfect 3-chromatic graphs, The matroids with the max-flow min-cut property, Blocking, antiblocking, and pairs of matroids and polymatroids, Lower bounds on the cover-index of a graph, An abstract duality, The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets, Extremal problems for finite sets and convex hulls---a survey, On certain polytopes associated with graphs, Graph covers using \(t\)-colourable vertex sets., Clutters with \(\tau_ 2 \Relbar 2\tau\), Matchings and covers in hypergraphs, On totally dual integral systems, Lift-and-project ranks and antiblocker duality, Reliability, covering and balanced matrices, Classes of perfect graphs, Projective, affine, and abelian colorings of cubic graphs, A characterization of perfect graphs, Duality in mathematics and linear and integer programming, IFORS' Operational Research Hall of Fame Delbert Ray Fulkerson, A Class of Balanced Matrices Arising from Location Problems, Fractional covers for forests and matchings, On cliques associated to 3-set packing problems, Abelian Colourings of Cubic Graphs, Unions of perfect matchings in cubic graphs, Non-intersecting perfect matchings in cubic graphs (Extended abstract), Integer Rounding for Polymatroid and Branching Optimization Problems, On box totally dual integral polyhedra, Polyhedral Combinatorics in Combinatorial Optimization, Dual gauge programs, with applications to quadratic programming and the minimum-norm problem, Total dual integrality implies local strong unimodularity, Dynamic decomposition method for linear programming problems with ceneralized upper bounds, Lifting the facets of zero–one polytopes, (1,k)-configurations and facets for packing problems, Finite checkability for integer rounding properties in combinatorial programming problems, On the use of penumbras in blocking and antiblocking theory, Some facets of the simple plant location polytope, Polynomially bounded algorithms for locatingp-centers on a tree, Finite Solution Theory for Coalitional Games, Quasi-balanced matrices, Transversal matroid intersections and related packings, Line perfect graphs

Cites Work