A computational study of primal heuristics inside an MI(NL)P solver

DOI10.1007/s10898-017-0600-3zbMath1394.90432OpenAlexW2781709983MaRDI QIDQ683729

Timo Berthold

Publication date: 9 February 2018

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-017-0600-3

zbMATH Keywords

mixed integer nonlinear programmingcomputational studyprimal heuristics

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Online learning for scheduling MIP heuristics, Progress in mathematical programming solvers from 2001 to 2020, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization

Uses Software

• BARON
• SCIP
• UG
• SoPlex
• MIPLIB
• Benchmarks for Optimization Software
• Bonmin
• FEASPUMP
• Ipopt
• CppAD
• MINLPLib
• GloMIQO
• ParaSCIP
• MIPLIB2003

Cites Work

• Unnamed Item
• GLOMIQO: global mixed-integer quadratic optimizer
• A recipe for finding good solutions to MINLPs
• Heuristics for convex mixed integer nonlinear programs
• SCIP: solving constraint integer programs
• RENS. The optimal rounding
• A review of recent advances in global optimization
• Progress in presolving for mixed integer programming
• A feasibility pump for mixed integer nonlinear programs
• Feasibility pump 2.0
• Rounding-based heuristics for nonconvex MINLPS
• BARON: A general purpose global optimization software package
• A storm of feasibility pumps for nonconvex MINLP
• Could we use a million cores to solve an integer program?
• Measuring the impact of primal heuristics
• Undercover: a primal MINLP heuristic exploring a largest sub-MIP
• MIPLIB 2003
• Improving the feasibility pump
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• The feasibility pump
• MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
• Extending a CIP Framework to Solve MIQCPs
• Validation of nominations in gas network optimization: models, methods, and solutions
• Branching and bounds tighteningtechniques for non-convex MINLP
• Exploiting Erraticism in Search
• Rounding and Propagation Heuristics for Mixed Integer Programming
• Mixed Integer Programming: Analyzing 12 Years of Progress
• Constraint Integer Programming: A New Approach to Integrate CP and MIP