1

BREARLEY, A.L., MITRA, G., AND WILLIAMS, H.P. Analysis of mathematical programming problems prior to applying the simplex algorithm. Math. Program. 8 (1975), 54-83.

2

BIXBY, R.E., AND CUNNINGHAM, W.H. Converting linear programs to network problems. Math. Oper Res. 5 (1980), 321-357.

3

BRADLEY, G., BROWN, G., AND GRAVES, G. Design and implementation of large scale primal transshipment algorithms. Manage. Sc~. 24, (1977), 1-35.

4

GEOFFRION, A.M. The purpose of mathematical programming is insight, not numbers. Interfaces 7, 1 (1976), 81-92.

5

GILMORE, P., GREENBERG, H.J., AND KURATOR, W. A simplification analysis of the midterm energy market model and the national coal model. EIA Tech. Rep., Washington, D.C., 1980.

6

GLOVER, F., AND KLINGMAN, D. Modeling and solving network problems. In Design and Implementatmn of Opt~m~zatmn Software, H J. Greenberg (Ed.), Sijthoff & Noordhoff, The Netherlands, 1978, pp. 185-224.

7

GREENBERG, H.J. A new approach to analyze information contained in a model. In Validation and Assessment Issues of Energy Models, S.I Gass (Ed.), NBS Pub. 569, Washington, D.C., 1979, pp. 517-524.

8

GREENBERO, H.J. A tutorial on computer-assisted analysis. In Advanced Techniques in the Practtce of OR, H.J. Greenberg, F.H. Murphy, and S.S. Shaw (Eds.), American Elsevier, New York, 1982, pp. 212-249.

9

GREENBERG, H.J., AND KALAN, J.E. Enhancing Fortran to aid manipulation of large, structured matrices. J. Res. N.B S. 84 (1979), 21-50.

10

GREENBERG, H.J., AND MAYBEE, J.S. Computer-Assisted Analysis and Model Simplification, Academic Press, New York, 1981.

11

GREENBERG, H.J., LUNDGREN, J.R., AND MAYBEE, J.S. Graph theoretic methods for the qualitative analysis of rectangular matrices. Smm J. Alg. D=screte Methods 2 (1981), 227-239.

12

GREENBERG, H.J, LUNDGREN, J.R., AND MAYBEE, J.S. Inverting graphs of rectangular matrices. D=screte Appl. Math., to be published.

13

GREENEERG, H.J., AND RARICK, D.C. Determinmg GUB sets via an invert agenda algorithm. Math Program. 7 (1977), 240-244.

14

GUNAWARDANE, G., HOFF, S., AND SCHRAGE, L. Identification of special structure constraints in linear programs. Math. Program. 21 (1981), 90-97.

15

HELLERMAN, E., AND RARICK, D.C. Reinversmn wlth the preassigned pivot procedure. Math. Program. 1 (1971), 215-216

16

HELLERMAN, S., AND RARICK, D.C. The partitioned preassigned pivot procedure (P4). In Sparse Matrices and Their Apphcatmns. D.J. Rose and R.A. Willoughby (Eds.), Plenum, New York, 1972, pp. 65-76~

17

JOHNSON, D.B. Finding all the elementary ctrcmts of a directed graph. SIAM J. Comput. 4, (1975), 77-84

18

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]

19

KENDELL, M.G. A computer method of analyzing the structure of behavior models. In Lecture Notes in Economics and Mathematical Systems 80, N. Hawkes (Ed.), Springer, Heidelberg, Germany.

20

KLEE, V., AND LADNER, R. Quahtative matrices: Strong sign-solvability and weak satisfiabihty. In H.J. Greenberg and J.S. Maybee, Computer-Assisted Analysis and Model Simplification, Academic Press, New York, 1981, pp. 293-320.

21

KOOPMANS, T.C, AND BAUSCH, A.F. Selected topics in economics involving mathematical reasoning. SIAM Rev. 1, 2 (1959), 79-148.

22

William G. Kurator , Richard P. O'Neill, PERUSE: An Interactive System for Mathematical Programs, ACM Transactions on Mathematical Software (TOMS), v.6 n.4, p.489-509, Dec. 1980  [doi>10.1145/355921.355923]

23

Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997

24

ORCHARD-HAYS, W. Advanced Linear-Programming Computing Techmques. McGraw-Hill, New York, 1968

25

ROBERTS, F.S. Discrete Mathematwal Models with Applications to Soctal, Blologwal, and Environmental Problems Prentice-Hall, Englewood Cliffs, N.J., 1976.

26

RosE, D.J. Triangulated graphs and the elimination process. J. Math. Anal Appl. 32 (1970), 597-609.

27

SCHRACE, L. Some comments on hidden structures in linear programs. In H.J. Greenberg and J.S. Maybee, Computer-AssistedAnalys~s andModelS~mplification, Academic Press, New York, 1981, pp. 389-395

28

SHEIR, D.R., AND WITZGALL, C. Arc tolerances in shortest path and network flow problems. Networks 10 (1980), 277-291.

29

SIMON, H. Causal ordering and identifiability. In Studies in Econometric Method. Wiley, New York, 1953, pp 49-74.

30

TARJAN, R Depth-first search and linear graph algorithms. SIAM J Comput. 2 (1972),146-160.

31

WILLIAMS, H.P. Model Budding ~n Mathematical Programming. Wiley-Interscience, New York, 1978.

Harvey J. Greenberg, Enhancements of ANALYZE: a computer-assisted analysis system for linear programming, ACM Transactions on Mathematical Software (TOMS), v.19 n.2, p.233-256, June 1993

Richard E. Nance , C. Michael Overstreet , Ernest H. Page, Redundancy in model representation: a blessing or a curse?, Proceedings of the 28th conference on Winter simulation, p.701-707, December 08-11, 1996, Coronado, California, United States

Richard E. Nance , James D. Arthur, The methodology roles in the realization of a model development environment, Proceedings of the 20th conference on Winter simulation, p.220-225, December 12-14, 1988, San Diego, California, United States

Daniel R. Dolk, A generalized model management system for mathematical programming, ACM Transactions on Mathematical Software (TOMS), v.12 n.2, p.92-126, June 1986

Michael R. Wick , James R. Slagle, An Explanation Facility for Today's Expert Systems, IEEE Expert: Intelligent Systems and Their Applications, v.4 n.1, p.26-36, March 1989

Srinivasan Raghunathan, An application of qualitative reasoning to derive behavior from structure of quantitative models, Journal of Management Information Systems, v.11 n.1, p.73-100, June 1994

Nalân Gülpinar , Gregory Gutin , Gautam Mitra , István Maros, Detecting Embedded Networks in LP Using GUB Structures and IndependentSet Algorithms, Computational Optimization and Applications, v.15 n.3, p.235-247, 3.1.2000

Harvey Greenberg: colleagues