Dual integrality in b-matching problems

DOI10.1007/BFB0120895zbMATH Open0437.90060MaRDI QIDQ3879042FDOQ3879042

Authors: 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)

Cited In (9)

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

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

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