Skip to main content
Log in

Series parallel composition of greedy linear programming problems

  • Published:
Mathematical Programming Submit manuscript

Abstract

We study the concept of series and parallel composition of linear programming problems and show that greedy properties are inherited by such compositions. Our results are inspired by earlier work on compositions of flow problems. We make use of certain Monge properties as well as convexity properties which support the greedy method in other contexts.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Y.P. Aneja, R. Chandrasekaran and K.P.K. Nair, “Classes of linear programs with integral optimal solutions,”Mathematical Programming Study 25 (1985) 225–237.

    Google Scholar 

  2. W.W. Bein, “Netflows, polymatroids, and greedy structures,” Ph.D. Thesis, Universität Osnabrück (Osnabrück, Germany, 1986).

    Google Scholar 

  3. W.W. Bein and P. Brucker, “Greedy concepts for network flow problems,”Discrete Applied Mathematics 15 (1986) 135–144.

    Google Scholar 

  4. W.W. Bein, P. Brucker and A. Tamir, “Minimum cost flow algorithms for series parallel networks,”Discrete Applied Mathematics 10 (1985) 117–124.

    Google Scholar 

  5. P.C. Gilmore, E.L. Lawler and D.B. Shmoys, “Well-solved special cases,” in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds.,The Travelling Salesman Problem — A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985) pp. 87–143.

    Google Scholar 

  6. G.H. Hardy, J.E. Littlewood and G. Polya,Inequalities (Cambridge University Press, Cambridge, England, 1934).

    Google Scholar 

  7. A.J. Hoffman, “On simple linear programming problems,” in: V.L. Klee, ed.,Convexity, Proceedings of Symposia in Pure Mathematics, Vol. 7 (American Mathematical Society, Providence, RI, 1963) pp. 317–327.

    Google Scholar 

  8. A.J. Hoffman, “On greedy algorithms that succeed,” in: I. Anderson, ed.,Surveys in Combinatorics 1985. London Mathematical Society Lecture Note Series No. 103 (Cambridge University Press, Cambridge, England, 1985) pp. 97–112.

    Google Scholar 

  9. A.J. Hoffman, “On greedy algorithms for series parallel graphs,”Mathematical Programming 40 (1988) 197–204.

    Google Scholar 

  10. J. Kahn, oral communication (1988).

  11. G. Monge, “Mémoire sur la théorie des déblai et des remblai,”Histoire de l'Academie Royale des Sciences (année 1781) (Paris, 1784) pp. 666–704.

  12. C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization (Prentice-Hall, Englewood Cliffs, NJ, 1982).

    Google Scholar 

  13. J. Valdes, “Parsing flowcharts and series-parallel graphs,” Ph.D. Thesis, Stanford University (Stanford, CA, 1978).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bein, W.W., Brucker, P. & Hoffman, A.J. Series parallel composition of greedy linear programming problems. Mathematical Programming 62, 1–14 (1993). https://doi.org/10.1007/BF01585157

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Navigation