Preprocessing and Probing Techniques for Mixed Integer Programming Problems
ORSA Journal on Computing · 1994 · Volume 6 · Issue 4
Abstract
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. INFORMS Journal on Computing , ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
Keywords
preprocessing for mixed integer programming, preprocessing, probing
Enable JavaScript for citation tools and additional paper interactions.