On Dyadic Fractional Packings of $T$-Joins

DOI10.1137/21M1445260zbMath1502.90138MaRDI QIDQ5043644

Cornuéjols, Gérard, Ahmad Abdi, Zuzanna Palion

Publication date: 6 October 2022

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

zbMATH Keywords

combinatorial optimizationpolyhedral combinatoricsintegral polyhedron\(T\)-joins\(T\)-cutsdyadic rational

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Matching structure and the matching lattice
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Idealness of \(k\)-wise intersecting families
• Total dual dyadicness and dyadic generating sets
• Combinatorial Optimization
• On Odd Cuts and Plane Multicommodity Flows
• 2-Matchings and 2-covers of hypergraphs
• On the width-length inequality
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Matching, Euler tours and the Chinese postman
• Idealness of k-wise Intersecting Families
• Clean Clutters and Dyadic Fractional Packings
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: On Dyadic Fractional Packings of $T$-Joins