2012 | OriginalPaper | Chapter
Rounding and Propagation Heuristics for Mixed Integer Programming
Authors : Tobias Achterberg, Timo Berthold, Gregor Hendel
Published in: Operations Research Proceedings 2011
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Primal heuristics are an important component of state-of-the-art codes for mixed integer programming. In this paper, we focus on primal heuristics that only employ computationally inexpensive procedures such as rounding and logical deductions (propagation). We give an overview of eight different approaches. To assess the impact of these primal heuristics on the ability to find feasible solutions, in particular early during search, we introduce a new performance measure, the
primal integral
. Computational experiments evaluate this and other measures on MIPLIB 2010 benchmark instances.