Dual integrality in b-matching problems

DOI10.1007/BFB0120895MaRDI QIDQ3879042zbMATH OpenFDO

Authors William R. Pulleyblank

Publication date 1980

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

Full work available at URL https://doi.org/10.1007/BFB0120895

zbMATH Keywords

assignmentb-bicritical graphconvex hulldual integralitygraphinteger optimal dual solutionminimal linear systemperfect b-matchingpositive integral degree constraintweighted b-matching problem

Mathematics Subject Classification ID

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

Cited in

(9)

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

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)