scientific article; zbMATH DE number 3345048
From MaRDI portal
zbMath0217.18505MaRDI QIDQ5620998
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40)
Related Items
The disjunctive procedure and blocker duality, Polyhedral proof methods in combinatorial optimization, Idealness of k-wise Intersecting Families, On Dyadic Fractional Packings of $T$-Joins, Binary group and Chinese postman polyhedra, On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency, An analytic symmetrization of max flow-min cut, The equipartition polytope. I: Formulations, dimension and basic facets, Compositions for matroids with the Fulkerson property, Clean Clutters and Dyadic Fractional Packings, A generalization of Robacker's theorem, Polyhedra related to undirected multicommodity flows, Polyhedra of regular p-nary group problems, On ternary problems, Minimum weight \((T,d)\)-joins and multi-joins, Clean tangled clutters, simplices, and projective geometries, A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program, Packing boxes with harmonic bricks, On combinatorial properties of binary spaces, Blocking duality for \(p\)-modulus on networks and applications, The nonidealness index of circulant matrices, Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé, Representing matrices, Dual row modules and polyhedra of blocking group problems, Blocking and anti-blocking pairs of polyhedra, Cyclic group blocking polyhedra, Matroids and multicommodity flows, Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks, On ideal clutters, metrics and multiflows, On the mixed set covering, packing and partitioning polytope, Progress on the description of identifying code polyhedra for some families of split graphs, Polyhedra associated with identifying codes in graphs, Transversal matroid intersections and related packings, Energy of convex sets, shortest paths, and resistance, A constructive decomposition and Fulkerson's characterization of permutation matrices, Clutter nonidealness, Correction to 'A constructive decomposition and Fulkerson's characterization of permutation matrices', A proof of Fulkerson's characterization of permutation matrices, Blocking pairs of polyhedra arising from network flows, On a certain class of nonideal clutters, Some combinatorial properties of centrosymmetric matrices, On certain convex matrix sets, On packing and covering polyhedra in infinite dimensions, Chords and disjoint paths in matroids, An unbounded matroid intersection polyhedron, The matroids with the max-flow min-cut property, A two-commodity cut theorem, Blocking, antiblocking, and pairs of matroids and polymatroids, Analytic proofs of a network feasibility theorem and a theorem of Fulkerson, On ideal semicomplete digraphs, On removing a vertex from the assignment polytope, On the set covering polyhedron of circulant matrices, Characterization of facets for multiple right-hand choice linear programs, On Four Problems in Graph Theory, Thin Lehman matrices arising from finite groups, Anti-blocking polyhedra, Four problems on graphs with excluded minors, Dominants and submissives of matching polyhedra, On the use of penumbras in blocking and antiblocking theory, Integer Rounding for Polymatroid and Branching Optimization Problems, Polyhedral polarity defined by a general bilinear inequality, Packing rooted directed cuts in a weighted directed graph, Idealness of \(k\)-wise intersecting families
