1

AaAD1E, J. (Ed.). Nonhnear Programming, North-Holland, Amsterdam, The Netherlands, 1967.

2

ABADIE, J. (Ed). Integer and Nonlinear Programm~ng, North-Holland, Amsterdam, The Netherlands, 1970.

3

ABADIE, J., AND J. CARPENTER. "Generahzatlon of the Wolfe Reduced Gradmnt Method to the Case of Nonhnear Constraints" Opt:- mlzatlon, R. Fletcher (Ed.), Academic Press, New York, 1969

4

ABADIE, J; AND J. GaI~ou. "Numerical Experiments with the GRG Method". Integer and Nonhnear Programming, J. Abadle, (Ed.), North-Holland, Amsterdam, The Netherlands, 1970.

5

ANTHONISSE, J M., AND B. DORHOUT. "Numerical Methods of Mathematical Optimization "Management Science, Vol. 16, p. B-459.

6

ANTHONISSE, J. M ; A~D B. DORHOUT. "Numerical Methods of Mathematical Optlmlsatlon--A Rejoinder." Management Science, Vol. 16, B-461.

7

AP~ELGREN, L. "Computational Experience of a Vessel Scheduling Algorithm using Column Generatmn and Branch-and-Bound Techmques". Presented at the 7th Mathemat:cal Programming Symposium 1970, The Hague, The Netherlands, September, 1970.

8

ARONOFSKV, J S (Ed). Progress m Operalions Research, Volume HI Wiley, New York, 1969.

9

BALINSKI, M. L.; AND R. E. GOMORY. "A Primal Method for Assignment and Transportation Problems." Management Science, Vol. lO, pp 578-593.

10

BALINSKI, M. L.; ^NI) K. SPXSLBERa. "Methods for Integer Programming: Algebraic, Combinatorial, and Enumerative," Progress m Operations Research, Vol. III, J. S. Aronofsky (Ed.), Wiley, New York, 1969.

11

BARNETSON, P. Critical Path Planning, Newnes Books, England, 1968.

12

Richard H. Bartels , Gene H. Golub, The simplex method of linear programming using LU decomposition, Communications of the ACM, v.12 n.5, p.266-268, May 1969  [doi>10.1145/362946.362974]

13

BEALE, E. M.L. "Numerical Methods". Nonhnear Programming, J. Abadie (Ed.), North- Holland, Amsterdam, The Netherlands, 1967.

14

BEALE, E. M. L Mathematical Programming in Practice, Pitman, New York, 1968.

15

BEALE, E. M. L. "Mathematical Programmmg: Algorithms," Progress ~n Operatwns Research, Vol. III, J. Aronofsky (Ed.), Wiley, New York, pp. 135-174.

16

BEALE, E. M.L. "Sparseness in Linear Programmmg", Large Sparse Sets o} Linear Equatwns. J. K. Reid (Ed.), Academic Press, New York, 1971.

17

BEALE, E. M. L ; any j. A. TOMLIN. "Special Facihtms in a General Mathematical Programmmg System for Non-Convex Problems Using Ordered Sets of Variables," Proc. 5th IFORS ConIerence J. Lawrence, (Ed.), Tawstock, London, 1970.

18

Richard Ernest Bellman, Dynamic Programming, Dover Publications, Incorporated, 2003

19

BENICHOU, M.; J. M. GAUTHIER, P. GIROI)ET, G. HENTGES, G. Rmmas, A~D O. VINCENT. "Exper:ments in Mixed Integer Linear Programmmg," Mathemat,cal Programming, Vol. 1, pp. 76-94, 1971.

20

BO~ER, J S. "Mathematical Programming: Computer Systems." Progress in Operations Research, Vol. III, J. Aronofsky Wiley, New York, (Ed.), 1969, pp. 115-134.

21

T. A. Bray , C. Witzgall, Algorithms: Algorithm 336: netflow, Communications of the ACM, v.11 n.9, p.631-633, Sept. 1968  [doi>10.1145/364063.364085]

22

BuzBY, B. "Techniques and Experience Solving Really Big Nonlinear Programs." NATO Conference on Large Scale Systems, Elsinor, Denmark, July 1971.

23

Collected Algorithms o} th'e CACM ACM New York (updated bimonthly).

24

COLVILLE, A. R. "A Comparative Study of Nonlinear Programming Codes." Proceedings o} the Princeton Symposium on Mathematical Programming, H W. Kuhn, (Ed.), Princeton University Press, 1970, pp. 487-501.

25

COT~Lv., R. W "The Principal Pivoting Method of Quadratic Programming." Mathematics o} the Deciszon Sciences, G. B. Dantzlg and A. F. Veinott Jr (Eds). American Mathematical Socmty, Providence, R.I., 1968.

26

DAKIN, R.J. "A Tree Search Algorithm for M~xed Integer Programming Problems." The Computer Journal, Vol. 8, 1965, pp. 250-255

27

DANTZm, G B Linear Programming and ;Extenswns. Princeton University Press, Princeton, N.J, 1963.

28

DANTZI6, G. B.; R. P. HARVEY; R. D. Mc- KNIGHT; AND S. S. SMITH. "Sparse Matrix Techmques in Two Mathematical Programming Codes." Sparse Matr,x Proceedings, R. A. Willoughby (Ed.), IBM, Yorktown Heights, N.Y.

29

DANvzm, G. B.; AND R. M. VAN SLYKE. "Generalized Upper Bounding Techniques for Linear Programming." Journal o} System and Computer Sciences, 1, 3 (October 1967).

30

vEBucNET, J., "How to Take into Account the Low Density of Matrices to Design a Mathematical Programming Package." Large Sparse Sets o} L~near Equations, A. K. Reid (Ed.), Academic Press, New York, 1971.

31

Jack B. Dennis, A High-Speed Computer Technique for the Transportation Problem, Journal of the ACM (JACM), v.5 n.2, p.132-153, April 1958  [doi>10.1145/320924.320927]

32

DREYFUS, S. E, "An Appraisal of Some Shortest-Path Algorithms" Operations Research, 17, 3 (1969).

33

DZIELINSKI, B. P.; AND R. E. GOMOEY. "Optimal Programming of Lot Sizes, Inventory and Labor Allocations." Management Science, Vol. 11, 1965, pp 874-890.

34

FEUF.~, A. "Review of I-Ilmmelblau's Apphed Nonlinear Programming." Operations Research, 21, (January-February 1973), pp. 396-397.

35

FIAcco, A. V., any G. P. McCoRMICK. "Computahonal Algorithm for the Sequential Unconstrained Minimization Technique for Nonlinear Programming." Management Science, 10, 4 (1964), pp. 601-617.

36

FLETCHEn, R. (Ed.). Optzm~zat~on. Academic Press, New York, 1969.

37

FLETCHER, R., AND M J. D. POWELL. "A Rapidly Convergent Descent Method for Minimization." Computer Journal, Vol. 6, pp. 163-- 168.

38

FORD. L R., AND D. R. FULKERSON. Flows in Networks. Plmceton University Press, Princeton, N.J., 1963.

39

FORREST, J. J. H.; AND J. A. TOMLIN, "Updating Triangular Factors of the Basis to Maintain Sparsity in the Product Form Simplex Method." Mathematical Programmzng, 2, 3 (1972), pp. 263-278.

40

FoR~.s~, J. J. H.; J. P. H Hms~; AND J. A. TOMLIN "Practical Solutions of Large and Complex Integer Programming Problems with UMPIRE." Management Science, to appear.

41

GAss, S. I. Linear Programming. McGraw- Hill, New York, 1969.

42

GEOFFRIOS, A. M. "Recent Computational Experience with Three Classes of Integer Linear Programs." Working Paper P-3699, The RAND Corporation, Santa Monica, Calif., October, 1967

43

GEOFFaION, A. M. "Elements of Large-Scale Mathematical Programming, Parts I and II." Management Science, 16, 11 (July 1970).

44

GILL, P. E.; AND W. MURItAY, "A Numerically Stable Form of The Simplex Algorithm." Department of Numerical Analysis and Mathematics Report Number 87, Natmnal Physical Laboratory, Teddington, M~ddlesex, England, 1970.

45

GILL, P. E.; ^m) W. MVRRAY. "Two Methods for the Solution of Linearly Constrained and Unconstrained Optimlzahon Problems." Divmmn of Numerical Analysis and Computing Report NAC 25, National Physical Laboratory, Teddington, Middlesex, England, 1972.

46

GILMORE, P. C.; AND R. E. GOMORY. "A Linear Programming Approach to the Cutting Stock Problem." Part I, Operatwns Research, Volume 9, pp. 849--859; Part Ii, Operations Research, Volume 11, pp. 863-887, 1963.

47

GOLDFARB, D.; AND L. LAPIDUS, "Conjugate Gradient Method for Nonlinear Programming Problems with Linear Constraints." Ind. Eng. Chem. Fundamentals, Vol 7, 1968, pp. 142ff.

48

GOMORY, R.E. "Some Polyhedra Related to Combinatorial Problems." Linear Algebra and its Apphcations, Vol. 2, 1969, pp. 451-558.

49

GOMORY, R. E.; AND E. L JOHNSON, "Some Continuous Functions Related to Corner Polyhedra, I." Mathematwal Programming, Volume 3, 1972, pp. 23-86.

50

GOMORY, R. E, AND E. L. JOHNSON, "Some " Continuous Functions Related to Corner Polyhedra, II," Mathematical Programming, Volume 3, 1972, pp. 359-389.

51

GORRY, G. A.; AND J. F. SHAPIRO. "An Adaptive Group Theoretic Algorithm for Integer Programming Problems," Management Science, 17, 5 (January 1971).

52

GRAVES, R. L.; AND P. WOL~S (Eds.). Recent Advances in Mathematzcal Programming. Mc- Graw-Hill, New York, 1963.

53

GRIFFITH, R. E; AND R. A. STEW~T. "A Nonlinear Programming Technique for the Optimization of Continuous Processing System." Management Science, 7, 4 (July 1961), pp 379-392.

54

GRmORIADIS, M. D., "Unified Pivoting Procedures for Large Structured Linear Systems and Programs " Decomposition o} Large-Scale Problems D. M. Himmelblau (Ed), North- Holland, Amsterdam, The Netherlands, 1973.

55

GI~I(}ORIADIS, M. D, AND W. F. WALKER. "A Treatment of Transportation Problems by Primal Partition Programming." Management Science, 14, 9 (1968).

56

M. D. Grigoriadis , L. Papayanopoulos , K. Spielberg, Experimental implementations of mixed integer programming algorithms, Proceedings of the 1971 26th annual conference, p.295-300, January 1971  [doi>10.1145/800184.810498]

57

HADLEY, G. Linear Programming. Addison- Wesley, Reading, Mass, 1962.

58

H^LLENE, D, "PTMZATN-Taking the I/O Out of Optimization" Proceedings o.f ,SHARE 88, San Francisco, Calif., March, 1972.

59

HANSEN, T.; ant) H SCARF. The Computaappear, Fall 1973.

60

HARRIS, P M.J. "Pivot Selection Methods of the DEVEX L.P. Code" British Petroleum Co. London, England, 1972.

61

HELLERMAN, E.; AND D. RARICK. "Reinversion with the Preassigned Pivot Procedure." Mathematical Programming, 1, 2 (1971), pp. 195-216

62

HELLERMAN, E., AND D. RARICK. "The Partitioned Preassigned Pivot Procedure (P4)." Sparse Matrices and Their Apphcation. D. J. Rose and R. A Willoughby (Eds.), Plenum Press, N.Y.

63

HIMMELBLAU, D.M. Applied Nonhnear Programm~ng, McGraw-Hill, New York, 1972.

64

HIRSHFELD, D M. "Mathematical Programmmg Development at Management Science System, Inc." Proceedings of SHARE 88, San Francisco, Calif., March, 1972.

65

JOHNSON, E. L.; AND K SPIELBERG. Inequalitires in Branch and Bound Programming." Report RC 3649, IBM Research, Yorktown Heights, New York, December, 1971.

66

James E. Kalan, Aspects of large-scale in-core linear programming, Proceedings of the 1971 26th annual conference, p.304-313, January 1971  [doi>10.1145/800184.810500]

67

KuNzI, H. P.; TZSCHACH; H. G. AND C. A. ZEHNDER. Numerical Methods o} Mathematical Optzmization. Academic Press, New York, 1968.

68

KuNzI, H. P., TZSCHACH, H. G., A~D C A ZEHNDER. "Numerical Methods of MathemaUcal Optimlzatlon--A Reply." Management Science, 16, 3 (April, 1970).

69

Hans P. Kunzi , H. G. Tzschach , C. A. Zehnder, Numerical Methods of Mathematical Optimization with ALGOL and FORTRAN Programs, Academic Press, Inc., Orlando, FL, 1971

70

LAGEMANN, J. S. "A Method for Solvmg the Transportation Problem " Naval Research Logistws Quarterly, 14, 1, (March 1967).

71

LAND, A. H.; AND G. MORTON. "An Inverse- Basis Method for Beale's Quadratic Programming Algorithm," Management Sczence, 19, 5, (January 1973), pp. 510-516

72

L. J. Larsen, A modified inversion procedure for product form of the inverse linear programming codes, Communications of the ACM, v.5 n.7, p.382-383, July 1962  [doi>10.1145/368273.368283]

73

LASDON, L.S. Optimization Theory }or Large Systems, The Macmillan Company, New York, 1970.

74

MANGA.SARIAN, O., Nonlinear Programming, McGraw-Hill, New York, 1969

75

MERRILL, O. H. "Application and Extensions of an Algorithm that Computes Fixed Points of Certain Non-empty Convex Upper Semi-continuous Point to Set Mappings." Report 71-7, Dept. of Industrial Engineering, University of Michigan, Ann Arbor, Mich, September 1971.

76

MmLER, C.E. "The Simplex Method for Local Separable Programming." Recent Advances in Mathematzcal Programming. R. L. Graves and P. Wolfe (Eds.), McGraw-Hill, New York, 1963.

77

MODER, J. J.; AND C. R. PHILLIPS, Project Management w~th CPM and PERT, Reinhold, New York, 1964

78

MURTAGH, B A.; AND R. W. H. SARGENT. "A Constrained Minimization Method with Quadratic Convergence "

79

ORCHARD-HAYs, W. Advanced Linear Programmmg Computing Techniques. McGraw- Hill, New York, 1968.

80

ORCHARD-HAYS, W. "Program Development at Management Science Systems, Inc ," Proceedmgs o} Share 84, Denver, Colo. March 1970.

81

PEARSON, J. D. "Variable Metric Methods of Minimization." Brit. Computer J., Vol. 12, 1969, pp. 171-178.

82

POLAK, E. Computatzonal Methods in Optimization. Academic Press, New York, 1971.

83

POWELL, M. J.D. "An Efficient Method for Finding the Minimum of a Function of Several Variables Without Calculating Derivatives." Computer Journal, Vol. 7, pp. 155-162

84

PRABHAKAR, T "Operation of a Large Nonlinear Production and Distribution Planning Model." Nonlinear Programming Symposium, George Washington University, Washington, D.C., March 14-16, 1973.

85

Proceedings o} SHARE 8~, held in Denver, Colorado, March, 1970.

86

REID, J. K., (Ed.). Large Sparse Sets o} L~near Equations. Academic Press, New York, 1971.

87

RosE, D J., ^~D R. A WmI~UGHBY (Eds.). Sparse Matrices and Thezr Applications, Plenum Press, New York, 1972.

88

RUSIN, M. H. "A Revised Simplex Method for Quadratic Programming" SIAM Journal, 20, 2 (March 1971), pp. 143-160.

89

SAV~DERS, J. "Large-Scale Linear Programmmg Using the Cholesky Factorizatlon" STAN-CS-72-252, Computer Science Department, Stanford University, Stanford, Cahf, January, 1972

90

SmMAP Newsletter, Nos. 10, 11, 12, 13, ACM, New York, 1971-1973.

91

SMITH, D. M. ; AND W ORCHARD-HAYs "Computational Efficiency in Product Form LP Codes." Recent Advances in Mathematical Programm~ug, R. L. Graves and P Wolfe (Eds), McGraw-Hill, New York.

92

STAHA, R. S, AND D. M. HIMMELBLAU, "An Evaluation of Nonlinear Programming Techniques for Problems with Nonlinear Constraints" Nonlinear Programming Symposium, George Washington University, Washington, D C., March 14-16, 1973.

93

TOMLIN, J. A. "Maintaining a Sparse Inverse m the Simplex Method" Technical Report No. 70-16, Operations Research House, Stanford University, Stanford, California, November 1970.

94

TOMLIN, J. A, "Modifying Triangular Factors of the Basis in the Simplex Method", Sparse Matrices and Their Applications, D. J Rose and R A Willoughby, (Eds.), Plenum Press, New York.

95

TOMLIN, J. A, "Survey of Computational Methods for Solving Large Scale Systems", Report 72-25, Operations Research Department, Stanford University, Stanford, Calif., October 1972.

96

TOMLIN, J. A, "Pivoting for Sparsity and Size in Linear Programming Inversion Routines " J Inst. Math Appl., to appear.

97

WILLOUGHBY, R. A. (Ed) "Sparse Matrix Proceedings." Report RA1 ($11707), Thomas J Watson Research Center, IBM Corporatmn, Yorktown Heights, New York, March, 1969.

98

WOLFE, P. "Methods of Nonhnear Programming" Recent Advances in Mathematical Programming, R. L. Graves and P. Wolfe (Eds), McGraw-Hill, New York, 1963.

99

WOt~F~, P. "The Composite Simplex Method." SIAM Review, Vol. 7, pp 42--54.

100

WOLFE, P. "Trends m Linear Programming Computation." Sparse Matrtx Proceedings, R. A. Willoughby (Ed.), IBM, Yorktown Heights, N.Y., 1969.

101

WOLFE, P. Quoted in Preface, in Opt~mizatwn, R. Fletcher (Ed), Academic Press, New York, 1969.

102

WOLFE, P, AND L. CUTLER. "Experiments in Linear Programming," Recent Advances in Mathematical Programming, R. L. Graves and P. Wolfe (Eds.), McGraw-Hill, New York, 1969.

William M. Michaels , Richard P. O'Neill, A Mathematical Program Generator MPGENR, ACM Transactions on Mathematical Software (TOMS), v.6 n.1, p.31-44, March 1980

Francisco Walter Molina, A Survey of Resource Directive Decomposition in Mathematical Programming, ACM Computing Surveys (CSUR), v.11 n.2, p.95-104, June 1979

J. R. Rice , C. W. Gear , J. Ortega , B. Parlett , M. Schultz , L. F. Shampine , P. Wolfe , J. F. Traub, Numerical computations: its nature and research directions, ACM SIGNUM Newsletter, v.14 n.si-1, p.1-48, February 1979

Arthur M. Geoffrion, A guided tour of recent practical advances in integer linear programming, ACM SIGMAP Bulletin

William W. White: colleagues