Integrality gap minimization heuristics for binary mixed integer nonlinear programming

DOI10.1007/s10898-018-0623-4zbMath1402.90101OpenAlexW2789932487MaRDI QIDQ721171

Wendel Melo, Márcia H. C. Fampa, Fernanda M. P. Raupp

Publication date: 18 July 2018

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

Full work available at URL: https://doi.org/10.1007/s10898-018-0623-4

zbMATH Keywords

heuristicssolverbinary mixed integer nonlinear programmingintegrality gap minimization

Mathematics Subject Classification ID

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

Related Items

A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm, An overview of MINLP algorithms and their implementation in Muriqui optimizer, Two linear approximation algorithms for convex mixed integer nonlinear programming, On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions, Preface to the special issue ``GOW'16

Uses Software

• HSL
• AMPL
• MINLP
• FEASPUMP
• Ipopt
• MINLPLib

Cites Work

• A recipe for finding good solutions to MINLPs
• On the optimal design of water distribution networks: a practical MINLP approach
• Heuristics for convex mixed integer nonlinear programs
• Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
• An algorithm for nonlinear optimization problems with binary variables
• RENS. The optimal rounding
• Mixed integer nonlinear programming tools: a practical overview
• A feasibility pump for mixed integer nonlinear programs
• Solving mixed integer nonlinear programs by outer approximation
• Local branching
• On global optimization with indefinite quadratics
• Exploring relaxation induced neighborhoods to improve MIP solutions
• A storm of feasibility pumps for nonconvex MINLP
• Three ideas for a feasibility pump for nonconvex MINLP
• A note on solving MINLP's using formulation space search
• A feasibility pump heuristic for general mixed-integer problems
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Generalized Benders decomposition
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• Nonlinear Integer Programming
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• On branching rules for convex mixed-integer nonlinear optimization
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints