Preprocessing and probing techniques for mixed integer programming problems

M.W.P. Savelsbergh

Research output: Book/ReportReportAcademic

399 Downloads (Pure)


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.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages18
Publication statusPublished - 1992

Publication series

NameMemorandum COSOR
ISSN (Print)0926-4493


Dive into the research topics of 'Preprocessing and probing techniques for mixed integer programming problems'. Together they form a unique fingerprint.

Cite this