Local Branching Relaxation Heuristics for Integer Linear Programs

Large Neighborhood Search (LNS) is a popular heuristic algorithm for solving combinatorial optimization problems (COP). It starts with an initial solution to the problem and iteratively improves it by searching a large neighborhood around the current best solution. LNS relies on heuristics to select...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2023-05
Hauptverfasser:	Huang, Taoan, Ferber, Aaron, Tian, Yuandong, Dilkina, Bistra, Steiner, Benoit
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Combinatorial analysis Computer Science - Artificial Intelligence Heuristic Heuristic methods Integer programming Iterative methods Linear programming Neighborhoods Optimization
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!