Integrality gap minimization heuristics for binary mixed integer nonlinear programming

DOI10.1007/S10898-018-0623-4MaRDI QIDQ721171zbMATH OpenOpenAlexFDO

Authors Wendel Melo, Marcia 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

binary mixed integer nonlinear programmingheuristicsintegrality gap minimizationsolver

Mathematics Subject Classification ID

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

Recommendations

• Heuristics for convex mixed integer nonlinear programs
• Inexact feasibility pump for mixed integer nonlinear programming
• A feasibility pump for mixed integer nonlinear programs
• Rounding-based heuristics for nonconvex MINLPS
• A partitioning algorithm for the mixed integer nonlinear programming problem

Cites work

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

Cited in

(10)

• On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
• Computing feasible points for binary MINLPs with MPECs
• 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
• Heuristics for convex mixed integer nonlinear programs
• On the integrality gap of binary integer programs with Gaussian data
• Applications of mathematical programming to genetic biocontrol
• Analysis of power in preprocessing methodologies for datasets with missing values
• Preface to the special issue ``GOW'16

Describes a project that uses

Uses Software

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

This page was built for publication: Integrality gap minimization heuristics for binary mixed integer nonlinear programming

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