Rounding and Propagation Heuristics for Mixed Integer Programming

Tobias Achterberg (), Timo Berthold () and Gregor Hendel ()
Additional contact information
Tobias Achterberg: IBM Deutschland
Timo Berthold: Zuse Institute Berlin
Gregor Hendel: Zuse Institute Berlin

A chapter in Operations Research Proceedings 2011, 2012, pp 71-76 from Springer

Abstract: Abstract 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.

Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (5)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-29210-1_12

Ordering information: This item can be ordered from
http://www.springer.com/9783642292101

DOI: 10.1007/978-3-642-29210-1_12

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().