Integrality gap minimization heuristics for binary mixed integer nonlinear programming
type: Item
instance of: scholarly article
title: Integrality gap minimization heuristics for binary mixed integer nonlinear programming
zbMATH Open document ID: 1402.90101
author: Wendel Melo
author: Marcia Fampa
author: Fernanda M. P. Raupp
published in: Journal of Global Optimization
publication date: 2018-07-18T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6905235
zbMATH Keywords: binary mixed integer nonlinear programming
zbMATH Keywords: heuristics
zbMATH Keywords: integrality gap minimization
zbMATH Keywords: solver
describes a project that uses: FEASPUMP
describes a project that uses: Ipopt
describes a project that uses: AMPL
describes a project that uses: MINLPLib
describes a project that uses: MINLP
describes a project that uses: HSL
MaRDI profile type: Publication
full work available at URL: s10898-018-0623-4
OpenAlex ID: W2789932487
cites work: Three ideas for a feasibility pump for nonconvex MINLP
cites work: A feasibility pump heuristic for general mixed-integer problems
cites work: RENS. The optimal rounding
cites work: A feasibility pump for mixed integer nonlinear programs
cites work: Heuristics for convex mixed integer nonlinear programs
cites work: Algorithms and Software for Convex Mixed Integer Nonlinear Programs
cites work: On branching rules for convex mixed-integer nonlinear optimization
cites work: On the optimal design of water distribution networks: a practical MINLP approach
cites work: Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
cites work: A storm of feasibility pumps for nonconvex MINLP
cites work: Mixed integer nonlinear programming tools: a practical overview
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: On global optimization with indefinite quadratics
cites work: Local branching
cites work: Solving mixed integer nonlinear programs by outer approximation
cites work: Generalized Benders decomposition
cites work: Nonlinear Integer Programming
cites work: A recipe for finding good solutions to MINLPs
cites work: A note on solving MINLP's using formulation space search
cites work: An algorithm for nonlinear optimization problems with binary variables
cites work: On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
DOI: 10.1007/S10898-018-0623-4
description: scientific article; zbMATH DE number 6905235