Generalized Networks: The Theory of Preprocessing and an Empirical Analysis

References

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