Skip to main content
SpringerLink
Log in
Book cover

Polyhedral Combinatorics pp 88–105Cite as

A practical algorithm for the Menger-type generalization of the independent assignment problem

  • Chapter
  • First Online:

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

Abstract

It is shown that the primal-dual algorithm for the ordinary assignment problem and for its Menger-type generalization can be extended in a natural manner to the case where both the entrance vertex set and the exit vertex set of the underlying graph are endowed with respective matroidal structures. The generalization of a Menger theorem is proved on the basis of the algorithm.

This work was supported by the Grant in Aid for Scientific Research of the Ministry of Education, Science and Culture of Japan under Grant: Cooperative Research (A) 135017 (1976, 1977).

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Berge, Graphes et hypergraphes (Dunod, Paris, 1971).

    Google Scholar 

  2. R.A. Brualdi, “Menger’s theorem and matroids”, Journal of the London Mathematical Society 2 (1971) 46–50.

    Article  MathSciNet  Google Scholar 

  3. J. Edmonds, “Submodular functions, matroids and certain polyhedra”, in: Combinatorial structures and their applications, Calgary International Conference (Gordon and Breach, New York, 1970) pp. 69–87.

    Google Scholar 

  4. J. Edmonds and R. Giles, “A min-max relation for submodular functions on graphs”, CORE Discussion Papers, No. 7615, Center for Operations Research and Econometrics, Université catholique de Louvain (1976).

    Google Scholar 

  5. S. Fijishige, “A primal approach to the independent assignment problem”, Journal of the Operations Research Society of Japan 20 (1977) 1–15.

    MathSciNet  Google Scholar 

  6. S. Fujishige, “An algorithm for finding an optimal independent linkage”, Journal of the Operations Research Society of Japan 20 (1977) 59–75.

    MATH  MathSciNet  Google Scholar 

  7. L.R. Ford, Jr., and D.R. Fulkerson, Flows in networks (Princeton University Press, Princeton, 1962).

    MATH  Google Scholar 

  8. F. Harary, Graph theory (Addison-Wesley, Reading, MA, 1969).

    Google Scholar 

  9. M. Iri, Network flow, transportation and scheduling—Theory and algorithms (Academic Press, New York, 1969).

    MATH  Google Scholar 

  10. M. Iri, “Practical algorithms for transformations of matroids and their applications to the problems of networks and control”, XXIIth International Meeting of TIMS, Kyoto (July 1975) SI7.2.

    Google Scholar 

  11. M. Iri, S. Fujishige and N. Tomizawa, “Algorithm for the minimum-cost flow problem with polymatroidal supplies and demands” (in preparation).

    Google Scholar 

  12. M. Iri and N. Tomizawa, “A unifying approach to fundamental problems in network theory by means of matroids”, Transactions of the institute of electronics and communication engineers of Japan 58A (1975) 33–40 (in Japanese). [English translation in: Electronics and Communications in Japan 58A (1975) 28–35.]

    MathSciNet  Google Scholar 

  13. M. Iri and N. Tomizawa, “An algorithm for finding an optimal independent assignment”, Journal of the Operations Research Society of Japan 19 (1976) 32–57.

    MATH  MathSciNet  Google Scholar 

  14. J.B. Kruskal, “On the shortest spanning subtree of a graph and the travelling salesman problem”, Proceedings of the American Mathematical Society (1956) 48–50.

    Google Scholar 

  15. E.L. Lawler, Combinatorial optimization: networks and matroids (Holt, Rinehart and Winston, New York, 1976).

    MATH  Google Scholar 

  16. C.J.H. McDiarmid, “Rado’s theorem for polymatroids”, Mathematical Proceedings of the Cambridge Philosophical Society 78 (1975) 263–281.

    Article  MATH  MathSciNet  Google Scholar 

  17. A. Recski, “Contributions to the n-port interconnection problem by means of matroids”, IXth International Symposium on Mathematical Programming, Budapest (August 1976).

    Google Scholar 

  18. D.J.A. Welsh, “Kruskal’s theorem for matroids”, Proceedings of the Cambridge Philosophical Society 64 (1968) 3–4.

    Article  MATH  MathSciNet  Google Scholar 

  19. D.J.A. Welsh, Matroid theory (Academic Press, New York, 1976).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Tokyo, Tokyo, Japan

    Masao Iri

Authors
  1. Masao Iri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. L. Balinski A. J. Hoffman

Additional information

Dedicated to the late Professor Delbert Ray Fulkerson

Rights and permissions

Reprints and permissions

Copyright information

© 1978 The Mathematical Programming Society

About this chapter

Cite this chapter

Iri, M. (1978). A practical algorithm for the Menger-type generalization of the independent assignment problem. In: Balinski, M.L., Hoffman, A.J. (eds) Polyhedral Combinatorics. Mathematical Programming Studies, vol 8. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121196

Download citation

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

  • Received:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00789-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation