Preprocessing and Probing Techniques for Mixed Integer Programming Problems

Abstract
In the rst part of the paper we present a framework for describing basic tech niques to improve the representation of a mixed integer programming problem We elaborate on identi cation of infeasibility and redundancy improvement of bounds and coe cients and xing 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

This publication has 0 references indexed in Scilit: