Intersecting restrictions in clutters

DOI10.1007/s00493-020-4076-2zbMath1488.90239OpenAlexW2988727595MaRDI QIDQ2658378

Ahmad Abdi, Dabeen Lee, Cornuéjols, Gérard

Publication date: 20 March 2021

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: http://eprints.lse.ac.uk/102394/1/int_rest.pdf

zbMATH Keywords

clutterdeltasblockers of extended odd holesintersecting minor

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (6)

Idealness of k-wise Intersecting Families ⋮ Clean Clutters and Dyadic Fractional Packings ⋮ Intersecting and dense restrictions of clutters in polynomial time ⋮ Clean tangled clutters, simplices, and projective geometries ⋮ A new infinite class of ideal minimally non-packing clutters ⋮ Idealness of \(k\)-wise intersecting families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of simple games
• The complexity of recognizing linear systems with certain integrality properties
• A polynomial-time algorithm, based on Newton's method, for linear programming
• A counterexample to a conjecture of Edmonds and Giles
• The matroids with the max-flow min-cut property
• Ideal 0, 1 matrices
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Cuboids, a class of clutters
• Deltas, extended odd holes and their blockers
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• On the width—length inequality
• The Forbidden Minors of Binary Clutters
• A generalization of max flow—min cut
• Opposite Elements in Clutters
• Ideal Clutters That Do Not Pack
• Bottleneck extrema
• The packing property.

This page was built for publication: Intersecting restrictions in clutters