Weighted iterated local branching for mathematical programming problems with binary variables

Local search algorithms are frequently used to handle complex optimization problems involving binary decision variables. One way of implementing a local search procedure is by using a mixed-integer programming solver to explore a neighborhood defined through a constraint that limits the number of bi...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of heuristics Jg. 28; H. 3; S. 329 - 350
Hauptverfasser:	Rodrigues, Filipe, Agra, Agostinho, Hvattum, Lars Magnus, Requejo, Cristina
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.06.2022 Springer Nature B.V
Schlagworte:	Artificial Intelligence Calculus of Variations and Optimal Control; Optimization Heuristic Integer programming Iterative methods Management Science Mathematical programming Mathematics Mathematics and Statistics Mixed integer Operations Research Operations Research/Decision Theory Optimization Search algorithms Solvers Matheuristic Neighborhood search Mixed-integer programming Boolean optimization
ISSN:	1381-1231, 1572-9397
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!