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

DOI10.1007/S10898-017-0600-3zbMATH Open1394.90432OpenAlexW2781709983MaRDI QIDQ683729FDOQ683729

Authors: 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

Recommendations

• Measuring the impact of primal heuristics
• Improving the performance of MIP and MINLP solvers by integrated heuristics
• Rounding and propagation heuristics for mixed integer programming
• Structure-driven fix-and-propagate heuristics for mixed integer programming
• A primal heuristic for nonsmooth mixed integer nonlinear optimization

zbMATH Keywords

mixed integer nonlinear programmingprimal heuristicscomputational study

Mathematics Subject Classification ID

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

Cites Work

• BARON: A general purpose global optimization software package
• MIPLIB 2003
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• MINLPLib -- a collection of test models for mixed-integer nonlinear programming
• Extending a CIP framework to solve MIQCPs
• GLOMIQO: global mixed-integer quadratic optimizer
• Title not available (Why is that?)
• SCIP: solving constraint integer programs
• A feasibility pump for mixed integer nonlinear programs
• Feasibility pump 2.0
• A storm of feasibility pumps for nonconvex MINLP
• Measuring the impact of primal heuristics
• Improving the feasibility pump
• The feasibility pump
• Heuristics for convex mixed integer nonlinear programs
• Exploiting erraticism in search
• Mixed integer programming: analyzing 12 years of progress
• A review of recent advances in global optimization
• Branching and bounds tighteningtechniques for non-convex MINLP
• Rounding-based heuristics for nonconvex MINLPS
• Undercover: a primal MINLP heuristic exploring a largest sub-MIP
• Validation of nominations in gas network optimization: models, methods, and solutions
• A recipe for finding good solutions to MINLPs
• Constraint Integer Programming: A New Approach to Integrate CP and MIP
• RENS. The optimal rounding
• Rounding and propagation heuristics for mixed integer programming
• Progress in presolving for mixed integer programming
• Could we use a million cores to solve an integer program?

Cited In (10)

• Progress in mathematical programming solvers from 2001 to 2020
• Rounding and propagation heuristics for mixed integer programming
• A primal heuristic for nonsmooth mixed integer nonlinear optimization
• The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
• Measuring the impact of primal heuristics
• Online learning for scheduling MIP heuristics
• Improving the performance of MIP and MINLP solvers by integrated heuristics
• Structure-driven fix-and-propagate heuristics for mixed integer programming
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
• Shift-and-propagate

Uses Software

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

This page was built for publication: A computational study of primal heuristics inside an MI(NL)P solver

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683729)