Odd Minimum Cut-Sets and b-Matchings 2: A Capacitated b-Matching Blossom Inequality Is Violated iff G(x, d) Has an Odd Cut of Capacity Less Than OneResearch Paper
A b-matching with upper bounds in a graph assigns a nonnegative integer to every edge so that the edges at each node carry at most in total. Maximizing a linear objective over such assignments is an integer program that contains ordinary matching (, ) and appears in assignment, transportation and scheduling models…