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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International transactions in operational research Jg. 27; H. 1; S. 418 - 434
Hauptverfasser:	Maravilha, André L., Carrano, Eduardo G., Campelo, Felipe
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford Blackwell Publishing Ltd 01.01.2020
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!