This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | |||
solver:references_for_lp_qp-presolve_techniques [2020/11/13 16:46] Atharv Bhosekar removed |
— (current) | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== References for LP/QP-Presolve Techniques ====== | ||
- | Find below a few references: | ||
- | |||
- | <code> | ||
- | E. D. Andersen and K. D. Andersen, | ||
- | Presolving in linear programming, | ||
- | Math. Programming 71(2):221--245, 1995 | ||
- | |||
- | C. Mészáros and U.H. Suhl, Advanced preprocessing techniques | ||
- | for linear and quadratic programming, | ||
- | OR Spectrum, 25(4), Springer, 2003, 575-595 | ||
- | |||
- | Jacek, Gondzio, Presolve Analysis of Linear Programs | ||
- | Prior to Applying an Interior Point Method, | ||
- | Logilab, HEC Geneva, Section of Management Studies, | ||
- | University of Geneva, 102 Bd Carl Vogt, CH-1211 Geneva 4, Switzerland | ||
- | Technical Report 1994.3 February 7, 1994, revised December 20, 1994 | ||
- | http://blogs.unige.ch/hec/logilab/template/papiers/papier64presolve.ps. | ||
- | </code> | ||
- | |||
- | The COIN-OR Manual (Section 3.4, search for "Reference") has some references on preprocessing techniques for mixed-integer problems. |