Skip to main content
SpringerLink
Log in

My experiences as a student and researcher in OR during the 1960’s and 70’s

  • 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

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  • Barr, R., F. Glover, and D. Klingman. (1979). “Enhancements of Spanning Tree Labeling Procedures for Network Optimization.” INFOR, 17, 16–34.

    Google Scholar 

  • Berge, C. and E.L. Johnson. (1977). “Coloring the Edges of a Hypergraph and Linear Programming Techniques.” Annals of Discrete Mathematics, 1, 65–78.

    Article  Google Scholar 

  • Crowder, H., E.L. Johnson, and M.W. Padberg. (1983). “Solving Large-Scale Zero-one Linear Programming Problems.” Operations Research, 31, 803–834.

    Google Scholar 

  • Edmonds, J. (1965). “Paths, Trees, and Flowers.” Canadian Journal of Mathematics, 17, 449–467.

    Google Scholar 

  • Edmonds, J. (1965). “Maximum Matching and a Polyhedron with 0–1 Vertices.” Journal of Research of the National Bureau of Standards B69, 125–130.

    Google Scholar 

  • Edmonds, J. and E.L. Johnson. (1970). “Matching: A Well-solved Class of Integer Linear Programs.” In R. Guy (Ed.), Proceedings of the Calgary International Conference on Combinatorial Structures and their Applications. New York: Gordon and Breach, pp. 69–87.

  • Edmonds, J. and E.L. Johnson. (1973). “Matching, Euler Tours, and the Chinese Postman.” Mathematical Programming, 5, 88–124.

    Article  Google Scholar 

  • Edmonds, J. (1970). “Submodular Functions, Matroids, and Certain Polyhedra.” In R. Guy (Ed.), Proceedings of the Calgary International Conference on Combinatorial Structures and their Applications. New York: Gordon and Breach, pp. 69–87.

  • Edmonds, J. and R.M. Karp. (1972). “Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.” Journal of the ACM, 19, 248–264.

    Article  Google Scholar 

  • Ferguson, C.H. and C.R. Morris, Computer Wars: How the West. Can Win in a Post-IBM World. Times Business.

  • Gastou, G. and E.L. Johnson. (1986). “Binary Group and Chinese Postman Polyhedra.” Mathematical Programming, 34, 1–33.

    Article  Google Scholar 

  • Glover, F., D. Karney, and D. Klingman. (1974). “Implementation and Computational Comparisons of Primal-dual Computer Codes for Minimum-cost Network Flow Problems.” Networks, 4, 191–212.

    Google Scholar 

  • Gomory, R.E. and E.L. Johnson. (1972). “Some Continuous Functions Related to Corner Polyhedra: I.” Mathematical Programming, 3, 23–85.

    Article  Google Scholar 

  • Gomory, R.E. and E.L. Johnson. (1972). “Some Continuous Functions Related to Corner Polyhedra II.” Mathematical Programming, 3, 359–389.

    Article  Google Scholar 

  • Guan, M. (1962). “Graphic Programming Using Odd or Even Points.” Chinese Mathematics, 1, 273–277.

    Google Scholar 

  • Johnson, E.L. (1966). “Networks and Basic Solutions.” Operations Research, 14, 619–623.

    Google Scholar 

  • Johnson, E.L., M.M. Kostreva, and U. Suhl. (1985). “Solving 0–1 Integer Programming Problems Arising from Large Scale Planning Models.” Operations Research, 33, 803–819.

    Google Scholar 

  • Johnson, E.L. (1974). “On the Group Problem for Mixed Integer Programming.” In M.L. Balinski (Ed.), Mathematical Programming. Study 2: Approaches to Integer Programming, pp. 137–179.

  • Lemke, C.E. and K. Spielberg. (1967). “Direct Search Algorithms for Zero-One and Mixed-Integer Programming.” Operations Research, 15, 892–914.

    Article  Google Scholar 

  • Srinivasan, V. and G. Thompson. (1973). “Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm.” JACM, 20, 194–213.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Georgia Tech, School of Industrial & Systems Eng., Atlanta, GA, 30322, USA

    Ellis Johnson

Authors
  1. Ellis Johnson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ellis Johnson.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Johnson, E. My experiences as a student and researcher in OR during the 1960’s and 70’s. Ann Oper Res 149, 121–135 (2007). https://doi.org/10.1007/s10479-006-0109-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-006-0109-5

Keywords

Search

Navigation