The packing property.
From MaRDI portal
Publication:5926333
DOI10.1007/s101070000184zbMath1033.90099MaRDI QIDQ5926333
Margot, François, Cornuéjols, Gérard, Guenin, Bertrand
Publication date: 18 February 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (20)
The positive circuits of oriented matroids with the packing property or idealness ⋮ Idealness of k-wise Intersecting Families ⋮ Delta Minors, Delta Free Clutters, and Entanglement ⋮ Lehman's Theorem and the Directed Steiner Tree Problem ⋮ Clean Clutters and Dyadic Fractional Packings ⋮ Intersecting restrictions in clutters ⋮ Clean tangled clutters, simplices, and projective geometries ⋮ On Packing Dijoins in Digraphs and Weighted Digraphs ⋮ The max-flow min-cut property and \(\pm 1\)-resistant sets ⋮ Cuboids, a class of clutters ⋮ Ideal clutters ⋮ A new infinite class of ideal minimally non-packing clutters ⋮ Idealness and 2-resistant sets ⋮ Blowup algebras of square-free monomial ideals and some links to combinatorial optimization problems ⋮ Opposite Elements in Clutters ⋮ Ideal Clutters That Do Not Pack ⋮ Implosive graphs: Square-free monomials on symbolic Rees algebras ⋮ Lehman matrices ⋮ Resistant Sets in the Unit Hypercube ⋮ Idealness of \(k\)-wise intersecting families
This page was built for publication: The packing property.
