Abstract
In 1982, Padberg and Rao gave a polynomial-time separation algorithm for b-matching polyhedra. The current best known implementations of their separation algorithm run in \({\cal O}(|V|^2|E| \log (|V|^2/|E|))\) time when there are no edge capacities, but in \({\cal O}(|V||E|^2 \log (|V|^2/|E|))\) time when capacities are present.
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. As well as being faster than the Padberg-Rao approach, our new algorithm is simpler and easier to implement.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Caprara, A., Fischetti, M.: {0, \(\frac{1}{2}\)}-Chvátal-Gomory cuts. Math. Program 74, 221–235 (1996)
Edmonds, J.: Maximum matching and a polyhedron with 0-1 vertices. J. Res. Nat. Bur. Standards 69B, 125–130 (1965)
Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum flow problem. J. of the A.C.M. 35, 921–940 (1988)
Gomory, R.E., Hu, T.C.: Multi-terminal network flows. SIAM J. Applied Math. 9, 551–570 (1961)
Grötschel, M., Holland, O.: A cutting plane algorithm for minimum perfect 2-matching. Computing 39, 327–344 (1987)
Grötschel, M., Lovász, L., Schrijver, A.J.: Geometric Algorithms and Combinatorial Optimization. Wiley, New York (1988)
Grötschel, M., Padberg, M.W.: On the symmetric travelling salesman problem I: inequalities. Math. Program. 16, 265–280 (1979)
Grötschel, M., Padberg, M.W.: On the symmetric travelling salesman problem II: lifting theorems and facets. Math. Program. 16, 281–302 (1979)
Letchford, A.N., Reinelt, G., Theis, D.O.: Odd minimum cut-sets and b-matchings revisited (in preparation)
Padberg, M.W., Rao, M.R.: Odd minimum cut-sets and b-matchings. Math. Oper. Res. 7, 67–80 (1982)
Padberg, M.W., Rinaldi, G.: Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Oper. Res. Lett. 6, 1–7 (1987)
Padberg, M.W., Rinaldi, G.: Facet identification for the symmetric traveling salesman polytope. Math. Program. 47, 219–257 (1990)
Pulleyblank, W.R.: Faces of matching polyhedra. Ph.D thesis, University of Waterloo (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Letchford, A.N., Reinelt, G., Theis, D.O. (2004). A Faster Exact Separation Algorithm for Blossom Inequalities. In: Bienstock, D., Nemhauser, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2004. Lecture Notes in Computer Science, vol 3064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25960-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-25960-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22113-5
Online ISBN: 978-3-540-25960-2
eBook Packages: Springer Book Archive