Dual integrality in b-matching problems

DOI10.1007/BFb0120895zbMath0437.90060MaRDI QIDQ3879042

William R. Pulleyblank

Publication date: 1980

Published in: Mathematical Programming Studies (Search for Journal in Brave)

zbMATH Keywords

graphconvex hullassignmentminimal linear systemdual integralityperfect b-matchingb-bicritical graphinteger optimal dual solutionpositive integral degree constraintweighted b-matching problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10)

Related Items (9)

Maximum and optimal 1-2 matching problem of the different kind ⋮ The Schrijver system of odd join polyhedra ⋮ An algorithmic approach to dual integrality of matching and extensions ⋮ Total dual integrality and b-matchings ⋮ Halin graphs and the travelling salesman problem ⋮ A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron ⋮ Brick decompositions and the matching rank of graphs ⋮ Total weak unimodularity: Testing and applications ⋮ A note on matchings and separability

This page was built for publication: Dual integrality in b-matching problems