Skip to main content
Log in

What the transportation problem did for me

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

References

  • Anonymous. (1955). “SEAC Determines Low Bidders.” Research Reviews, 11–12.

  • Baranyai, Z. (1973). “On the Factorization of the Complete Uniform Hypergraph.” In Proceedings of the Erdos Colloquium, Kesztheley. North-Holland, pp. 91–108.

  • Barnes, E., and A. Hoffman. (1985). “On Transportation Problems with Upper Bounds on Leading Rectangles.” SIAM Journal of Algebric and Discrete Methods, 6, 721–730.

    Google Scholar 

  • Bein, B., P. Brucker, and A. Hoffman. (1993). “Series Parallel Composition of Greedy Linear Programs.” Mathematical Programming, B-62, 1–14.

    Article  Google Scholar 

  • Burkard, R., B. Klinz, and R. Rudolf. (1996). “Perspectives of Monge Properties in Optimization.” Discrete Application of Mathematics, 70, 95–161.

    Article  Google Scholar 

  • Dietrich, B. and A. Hoffman. (2003). “On Greedy Algorithms, Partially Ordered Sets and Submodular Functions.” IBM Journal of Research and Development, 47, 25–30.

    Article  Google Scholar 

  • Ford, L. and D. Fulkerson. (1962). Flows in Networks. Princeton.

  • Hitchcock, F. (1941). “The Distribution of a Product from Several Sources to Numerous Localities.” Journal of Mathematics and Physics, 20, 224–230.

    Google Scholar 

  • Hoffman, A. (1960). “Some Recent Applications of the Theory of Linear Inequalities to Extremal Combinatorial Problems, Combinatorial Analysis.” In R. Bellman and M. Hall (Eds.), American Mathematical Society, pp. 113–127.

  • Hoffman, A. (2003). “Autobiographical Notes” in “Selected Papers of Alan Hoffman.” In C. Micchelli (Ed.), World Scientific Publishing Company.

  • Kuhn, H. and A. Tucker (Eds.). (1956). “Linear Inequalities and Related Systems.” Annual Mathematical Studies, Princeton.

  • Monge, G. (1781). “Deblai et Remblai.” Mem. de l’Academie des Sciences.

  • Queyranne, M., F. Spieksma, and F. Tardella. (1998). “A General Class of Greedily Solvable Linear Programs.” Mathematics of Operations Research, 23, 892–908.

    Article  Google Scholar 

  • Schrijver, A. (2003). Combinatorial Optimization (Polyhedra and Efficiency). Berlin: Springer Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alan Hoffman.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hoffman, A. What the transportation problem did for me. Ann Oper Res 149, 117–120 (2007). https://doi.org/10.1007/s10479-006-0108-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-006-0108-6

Keywords

Navigation