Integrality gap minimization heuristics for binary mixed integer nonlinear programming

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 var...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of global optimization Ročník 71; číslo 3; s. 593 - 612
Hlavní autori: Melo, Wendel, Fampa, Marcia, Raupp, Fernanda
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.07.2018
Springer
Springer Nature B.V
Predmet:
Algorithms
Computer Science
Heuristic
Mathematics
Mathematics and Statistics
Mixed integer
Nonlinear programming
Operations Research/Decision Theory
Optimization
Real Functions
Integrality gap minimization
Solver
Binary mixed integer nonlinear programming
Heuristics
ISSN:0925-5001, 1573-2916
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-018-0623-4