1. A. V. Aho, J. E. Hoperoft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Third printing, Reading, MA, 1976.
2. R. D. Armstrong and J. W. Hultz, “A Computational Study on Solving a Facility Location Problem with Least Absolute Value Criterion,” Abstracts for the International Symposium on Extremal Methods and Systems Analysis, Austin, 1977.
3. E. Balas and E. Zemel, “Solving Large Zero-One Knapsack Problems,” Management Sciences Report No. 408, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, June 1976, Revised July 1977.
4. I. Barrodale and F. D. K. Roberts, “An Improved Algorithm for Discrete kl Linear Approximation,” SIAM J. Numer Analy., 10, 839–848 (1973).
5. G. B. Dantzig and R. M. Van Slyke, “Generalized Upper Bounding Techniques for Linear Programming,” J. Comput. System Sci., 1, 213–226 (1967).