Preprocessing and Probing Techniques for Mixed Integer Programming Problems

@article{Savelsbergh1994PreprocessingAP,
  title={Preprocessing and Probing Techniques for Mixed Integer Programming Problems},
  author={Martin W. P. Savelsbergh},
  journal={INFORMS Journal on Computing},
  year={1994},
  volume={6},
  pages={445-454}
}
In the first part of the paper, we present a framework for describing basic techniques to improve the representation of a mixed integer programming problem. We elaborate on identification of infeasibility and redundancy, improvement of bounds and coefficients, and fixing of binary variables. In the second part of the paper, we discuss recent extensions to these basic techniques and elaborate on the investigation and possible uses of logical consequences. Preprocessing and Probing Techniques for… CONTINUE READING
Highly Influential
This paper has highly influenced 21 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Coefficient reduction for knapsack-like constraints in 0-1 program with variable upper bounds

  • B. L. DIETRICH, L. F. ESCUDERO
  • Oper. Res. Letters 2, 9-14.
  • 1990
Highly Influential
6 Excerpts

Solving mixed 0-1 programs by automatic reformulation

  • T. VAN Roy, L. A. WOLSEY
  • Oper. Res. 35, 45-57.
  • 1987

Similar Papers

Loading similar papers…