Clean clutters and dyadic fractional packings

DOI10.1137/21M1397325MaRDI QIDQ5071103zbMATH OpenOpenAlexFDO

Authors Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel

Publication date 20 April 2022

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/21m1397325

zbMATH Keywords

ideal clutterquasi-polynomial timecube-ideal setCarathéodory's theoremdyadic fractional packingprojective geometries over \(GF(2)\)

Mathematics Subject Classification ID

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

Recommendations

• Fractional packing in ideal clutters
• Fractional packing in ideal clutters
• scientific article; zbMATH DE number 1187138
• Clean tangled clutters, simplices, and projective geometries
• The packing property.

Cites work

• scientific article; zbMATH DE number 16724 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• scientific article; zbMATH DE number 3345048 (Why is no real title available?)
• 2-Matchings and 2-covers of hypergraphs
• A Solution of the Shannon Switching Game
• A class of simple games
• Blocking and anti-blocking pairs of polyhedra
• Bottleneck extrema
• Clean tangled clutters, simplices, and projective geometries
• Combinatorial optimization. Packing and covering
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Cuboids, a class of clutters
• Deltas, extended odd holes and their blockers
• Ideal 0, 1 matrices
• Ideal clutters that do not pack
• Idealness of \(k\)-wise intersecting families
• Intersecting restrictions in clutters
• Matching, Euler tours and the Chinese postman
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On the width-length inequality
• Packing odd T‐joins with at most two terminals
• Packing odd circuits in Eulerian graphs
• Perfect and ideal \(0, \pm 1\) matrices
• Resolution and the integrality of satisfiability problems
• The Cycling Property for the Clutter of Odd st-Walks
• The Forbidden Minors of Binary Clutters
• The complexity of recognizing linear systems with certain integrality properties
• The matroids with the max-flow min-cut property
• The packing property.
• \((0,\pm 1)\) ideal matrices

Cited in

(7)

• Fractional packing in ideal clutters
• Total dual dyadicness and dyadic generating sets
• On dyadic fractional packings of \(T\)-joins
• On Packing Dijoins in Digraphs and Weighted Digraphs
• Total dual dyadicness and dyadic generating sets
• Clean tangled clutters, simplices, and projective geometries
• Fractional packing in ideal clutters

Describes a project that uses

Uses Software

• cuboids-code

This page was built for publication: Clean clutters and dyadic fractional packings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5071103)