Opening Address

  • Darwin Klingman
Conference paper
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 199)


During the past decade, algorithmic research has focused on the design and development of efficient digital computer optimization software. From this research, an important interface between mathe­matics and computer science, called computer implementation technology, has evolved. While the origins of this technology date back to 1952 and the implementation of the stepping-stone method on the National Bureau of Standards’ Eastern Automatic Computer (Hoffman [4]), it has only been recently recognized as a major discipline in its own right.


Network Code Short Path Problem Demand Node Short Path Tree Billing System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Crowder, H., Dembo, R., and Mulvey, J., “Reporting Computational Experiments in Mathematical Programming, ” Mathematical Programming, 5, (1978), pp. 316–319.CrossRefGoogle Scholar
  2. [2]
    Gilsinn, J., and Witzgall, C., “A Performance Comparison of Labeling Algorithms for Calculating Shortest Path Trees,” Technical Note 772 ( National Bureau of Standards, Washington, DC, May 1973 ).Google Scholar
  3. [3]
    Clover, F., and Mulvey, J., “Equivalence of the 0–1 Integer Pro gramming Problem to Discrete Generalized and Pure Networks,” Operations Research, 28, 3, (May-June 1980) po. 829–836.CrossRefGoogle Scholar
  4. [4]
    Hoffman, A., Mannos, M., Sokolowsky, D., and Wiegmann, N., “Computational Experience in Solving Linear Programs,” J. Siam, 1, (1953), pp. 17–33.Google Scholar
  5. [5]
    Ylingman, D. and Monte, J., “A Multi-Period Distribution and Inventory Planning Model,” CCS 364, Center for Cybernetics Study, University of Texas, Austin, (Dec. 1979), pp. 1–42.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Darwin Klingman

There are no affiliations available

Personalised recommendations