##
###
A Faster Exact Separation Algorithm for Blossom Inequalities
[chapter]

Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis

2004
*
Lecture Notes in Computer Science
*

We propose a new *exact* separation algorithm for *the* capacitated case which has *the* same running time as for *the* uncapacitated case. ...
For *the* sake of brevity, however, we will restrict our introduction to *the* case of perfect 1-capacitated b-matchings, which includes, for example, *the* separation problem for perfect 2-matchings. ...
We need to *know* how a *minimum* (φ(e), k e )-*cut* in G R looks. Suppose that e = {φ(e), j}, i.e., j ∈ V is *the* other end of *the* edge e of G. ...

doi:10.1007/978-3-540-25960-2_15
fatcat:3m5e7ua7ajaxrpmcdtfwuvg24m