Rounding and Propagation Heuristics for Mixed Integer Programming
Please always quote using this URN:urn:nbn:de:0296-matheon-9774
- 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.
Author: | Tobias Achterberg, Timo Berthold, Gregor Hendel |
---|---|
URN: | urn:nbn:de:0296-matheon-9774 |
Referee: | Martin Grötschel |
Document Type: | Preprint, Research Center Matheon |
Language: | English |
Date of first Publication: | 2012/01/15 |
Release Date: | 2012/01/15 |
Tag: | domain propagation; mixed integer programming; primal heuristic |
Institute: | Zuse Institute Berlin (ZIB) |
MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C11 Mixed integer programming |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C59 Approximation methods and heuristics | |
Preprint Number: | 858 |