Moderate exponential-time algorithms for scheduling problems

This survey investigates the field of moderate exponential-time algorithms for N P -hard scheduling problems, i.e., exact algorithms whose worst-case time complexity is moderately exponential with respect to brute force algorithms. Scheduling problems are very challenging problems for which interest...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Annals of operations research 2024-12, Vol.343 (2), p.753-783
Hauptverfasser:	T’kindt, Vincent, Della Croce, Federico, Liedloff, Mathieu
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Business and Management Combinatorics Computer Science Graphs Lower bounds Operations Research/Decision Theory Original Research Scheduling Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!