Total dual integrality of matching forest constraints
From MaRDI portal
Publication:5932756
DOI10.1007/s004930070009zbMath0973.05060OpenAlexW2067980259MaRDI QIDQ5932756
Publication date: 13 June 2001
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/2104
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (7)
Revisiting a cutting-plane method for perfect matchings ⋮ Shortest bibranchings and valuated matroid intersection ⋮ Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs ⋮ Equitable partitions into matchings and coverings in mixed graphs ⋮ Optimal Matching Forests and Valuated Delta-Matroids ⋮ Permutation betting markets: singleton betting with extra information ⋮ Relationship of two formulations for shortest bibranchings
This page was built for publication: Total dual integrality of matching forest constraints