A recombination‐based matheuristic for mixed integer programming problems with binary variables

This work introduces a heuristic for mixed integer programming (MIP) problems with binary variables, based on information obtained from differences between feasible solutions as well as solutions from the linear relaxation. This information is used to build a neighborhood that is explored as a sub‐M...

Celý popis

Podrobná bibliografia

Vydané v:	International transactions in operational research Ročník 27; číslo 1; s. 418 - 434
Hlavní autori:	Maravilha, André L., Carrano, Eduardo G., Campelo, Felipe
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Blackwell Publishing Ltd 01.01.2020
Predmet:	branch and bound combinatorial optimization Heuristic Integer programming Linear programming local search Mathematical programming metaheuristics Mixed integer Operations research Polishing
ISSN:	0969-6016, 1475-3995
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!