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 mathematics 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 ), it has only been recently recognized as a major discipline in its own right.
KeywordsNetwork Code Short Path Problem Demand Node Short Path Tree Billing System
Unable to display preview. Download preview PDF.
- 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
- Hoffman, A., Mannos, M., Sokolowsky, D., and Wiegmann, N., “Computational Experience in Solving Linear Programs,” J. Siam, 1, (1953), pp. 17–33.Google Scholar
- 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