Generalized networks: The theory of preprocessing and an empirical analysis

INFORMS Journal on Computing

Volumn 16, Issue 2, 2004, Pages 162-173

  Kennington, Jeffery L ^a   Lewis, Karen R ^b  

^a Southern Methodist University   (United States)

^b UNIVERSITY OF MISSISSIPPI   (United States)

Author keywords

Generalized networks; Network flow algorithms; Network flow theory; Preprocessing; Presolve

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; LINEAR PROGRAMMING; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

GENERALIZED NETWORKS; NETWORK FLOW ALGORITHMS; NETWORK FLOW THEORY; PREPROCESSING TECHNIQUES;

COMPUTER NETWORKS;

EID: 3843113256     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1030.0031     Document Type: Article

References (18)

1. Adler, I., N. Karmarkar, M. G. Resende, G. Veiga. 1989. Data structures and programming techniques for the implementation of Karmarkar's algorithm. ORSA J. Comput. 1 84-106.
2. Andersen, E. D., K. D. Andersen. 1995. Presolving in linear programming. Math. Programming 71 221-245.
3. Bradley, G. H., G. G. Brown, G. W. Graves. 1983. Structural redundancy in large-scale optimization models. M. H. Karwan, V. Lofti, J. Telgen, S. Zionts, eds. Redundancy in Mathematical Programming. Springer-Verlag, Berlin, Germany, 145-169.
4. Brearley, A. L., G. Mitra, H. P. Williams. 1975. Analysis of mathematical programming problems prior to applying the simplex algorithm. Math. Programming 8 54-83.
5. Brown G. G., M. P. Olson. 1994. Dynamic factorization in large-scale optimization. Math. Programming 64 17-51.
6. Brown, G. G., D. S. Thomen. 1980. Automatic identification of generalized upper bounds in large-scale optimization models. Management Sci. 26 1166-1184.
7. Frangioni, A., G. Gallo. 1999. A bundle type dual-ascent approach to linear multicommodity min-cost flow problems. INFORMS J. Comput. 11 370-393.
8. Gondzio, J. 1997. Presolve analysis of linear programs prior to applying an interior point method. INFORMS J. Comput. 9 73-91.
9. Gulpinar, N., G. Gutin, G. Mitra, I. Maros. 2000. Detecting embedded networks in LP using GUB structures and independent set algorithms. Comput. Optim. Appl. 15 235-247.
10. Gulpinar, N., G. Mitra, I. Maros. 2002. Creating advanced bases for large scale linear programs exploiting embedded network structure. Comput. Optim. Appl. 21 71-93.
11. Kennington, J. L., K. R. Lewis. 2000. Preprocessing techniques for generalized networks: Theory and an empirical analysis. Technical Report 00-CSE-10, Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX.
12. Klein, D., S. J. Holm. 1983. Some reduction of linear programs using bounds on problem variables. M. H. Karwan, V. Lofti, J. Telgen, S. Zionts, eds. Redundancy in Mathematical Programming. Springer-Verlag, Berlin, Germany, 80-86.
13. Lewis, K.R. 2001. Preprocessing algorithms for generalized networks: Theory and an empirical analysis. Ph.D. thesis, Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX.
14. Lustig, I. J., R. E. Marsten, D. F. Shanno. 1994. Interior point methods for linear programming: Computational state of the art. ORSA J. Comput. 6 1-14.
15. McBride, R. D. 1998. Advances in solving the multicommodity-flow problem. Interfaces 28 32-41.
16. McBride, R. D., J. W. Mamer. 1997. Solving multicommodity flow problems with a primal embedded network simplex algorithm. INFORMS J. Comput. 9 154-163.
17. Tomlin, J. A., J. S. Welch. 1986. Finding duplicate rows in a linear programming model. Oper. Res. Lett. 5 7-11.
18. Williams, H. P. 1983. A reduction procedure for linear and integer programming models. M. H. Karwan, V. Lofti, J. Telgen, S. Zionts, eds. Redundancy in Mathematical Programming. Springer-Verlag, Berlin, Germany, 87-107.