Improving the Performance of MIP and MINLP Solvers by Integrated Heuristics

Timo Berthold ()
Additional contact information
Timo Berthold: Fair Isaac Germany GmbH, c/o Zuse Institute Berlin

A chapter in Operations Research Proceedings 2015, 2017, pp 19-24 from Springer

Abstract: Abstract This article provides an overview of the author’s dissertation (Berthold, Heuristic algorithms in global MINLP solvers, 2014, [4]). We study heuristic algorithms that are tightly integrated within global MINLP solvers and analyze their impact on the overall solution process. This comprises generalizations of primal heuristics for MIP towards MINLP as well as novel ideas for MINLP primal heuristics and for heuristic algorithms to take branching decisions and to collect global information in MIP.

Keywords: Mixed Integer; Mixed Integer Linear Programming; Relaxation Solution; Large Neighborhood Search; Mixed Integer Nonlinear Programming (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

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-319-42902-1_3

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

DOI: 10.1007/978-3-319-42902-1_3

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 ().