Preprocessing and probing techniques for mixed integer programming problems

Preprocessing and probing techniques for mixed integer programming problems

0.00 Avg rating0 Votes
Article ID: iaor19982431
Country: United States
Volume: 6
Issue: 4
Start Page Number: 445
End Page Number: 454
Publication Date: Sep 1994
Journal: ORSA Journal On Computing
Authors:
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.

Reviews

Required fields are marked *. Your email address will not be published.