Establishing the matching polytope

DOI10.1016/0095-8956(72)90002-0zbMath0239.05137OpenAlexW2027792479MaRDI QIDQ2553453

Michel Balinski

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(72)90002-0

Mathematics Subject Classification ID

Integer programming (90C10) Graph theory (05C99)

Related Items

On fractional realizations of graph degree sequences, A matching problem with side conditions, Sequential legislative lobbying, The travelling salesman problem and a class of polyhedra of diameter two, An efficient algorithm for minimumk-covers in weighted graphs, \(k\)-integrality, an extension of total unimodularity, A note on symmetric doubly-stochastic matrices, Line perfect graphs, Matchings and covers in hypergraphs, Properties of vertex packing and independence system polyhedra

Cites Work

• Integer Programming: Methods, Uses, Computations
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• Modification of Edmonds' maximum matching algorithm
• Unnamed Item