Skip to main content
SpringerLink
Log in

Dual integrality in b-matching problems

  • Chapter
  • First Online:
Combinatorial Optimization

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 12))

Abstract

We investigate the problem of when a b-matching problem with integer edge costs has an integer optimal dual solution. We introduce the concept of b-bicritical graphs, give a characterization of them and show that these play a pivotal role in determining when there exists an integer optimal dual solution.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aho, J. Hopcroft and J. Ullman, The design and analysis of computer algorithms (Addison-Wesley, Reading, MA, 1974).

    MATH  Google Scholar 

  2. C. Berge, “Sur le couplage maximum d'un graphe”, Comptes Rendus Hebdomadaires des séances de l'Académie des Sciences, 247 (1958) 258–259.

    MATH  MathSciNet  Google Scholar 

  3. W.H. Cunningham and A.B. Marsh III. “A primal algorithm for optimum matching”, Mathematical Programming Study 8 (1978) 50–72.

    MathSciNet  Google Scholar 

  4. J. Edmonds, “Paths trees and flowers”, Canadian Journal of Mathematics 17 (1965) 449–469.

    MATH  MathSciNet  Google Scholar 

  5. L. Lovász, “On the structure of factorizable graphs”, Acta Mathematica Academiae Scientiarum Hungaricae 23 (1972) 179–195.

    Article  MATH  MathSciNet  Google Scholar 

  6. L. Lovász and M.D. Plummer, “On bicritical graphs”, Colloquia Mathematica Societatis János Bolyai 10 (1973) 1051–1079.

    Google Scholar 

  7. W. Pulleyblank, “The faces of matching polyhedra”, Thesis, University of Waterloo (Waterloo, Ont., 1974).

    Google Scholar 

  8. W. Pulleyblank, “Minimum node covers and 2-bicritical graphs”, Mathematical Programming, 17 (1979) 91–103.

    Article  MATH  MathSciNet  Google Scholar 

  9. W.T. Tutte, “The factors of graphs”, Canadian Journal of Mathematics (1952) 315–318.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Calgary, Calgary, Alberta, Canada

    W. Pulleyblank

Authors
  1. W. Pulleyblank
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. W. Padberg

Rights and permissions

Reprints and permissions

Copyright information

© 1980 The Mathematical Programming Society

About this chapter

Cite this chapter

Pulleyblank, W. (1980). Dual integrality in b-matching problems. In: Padberg, M.W. (eds) Combinatorial Optimization. Mathematical Programming Studies, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120895

Download citation

  • DOI: https://doi.org/10.1007/BFb0120895

  • Received:

  • Revised:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00801-6

  • Online ISBN: 978-3-642-00802-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation