Title
Integrality gap minimization heuristics for binary mixed integer nonlinear programming.
Abstract
We present two feasibility heuristics for binary mixed integer nonlinear programming. Called integrality gap minimization algorithm (IGMA)—versions 1 and 2, our heuristics are based on the solution of integrality gap minimization problems with a space partitioning scheme defined over the integer variables of the problem addressed. Computational results on a set of benchmark instances show that the proposed approaches present satisfactory results.
Year
DOI
Venue
2018
https://doi.org/10.1007/s10898-018-0623-4
J. Global Optimization
Keywords
Field
DocType
Binary mixed integer nonlinear programming,Heuristics,Integrality gap minimization,Solver
Integer,Space partitioning,Mathematical optimization,Minification,Heuristics,Nonlinear mixed integer programming,Solver,Minimization algorithm,Mathematics,Binary number
Journal
Volume
Issue
ISSN
71
3
0925-5001
Citations 
PageRank 
References 
3
0.40
15
Authors
3
Name
Order
Citations
PageRank
Wendel Melo1133.02
Marcia Fampa25811.69
Fernanda M. P. Raupp3295.35