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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Annals of operations research Ročník 343; číslo 2; s. 753 - 783
Hlavní autori:	T’kindt, Vincent, Della Croce, Federico, Liedloff, Mathieu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.12.2024 Springer Springer Nature B.V Springer Verlag
Predmet:	Algorithms Approximation Business and Management Combinatorics Computer Science Graphs Lower bounds Mathematical optimization Methods Operations Research/Decision Theory Original Research Scheduling Scheduling (Management) Theory of Computation France 68W40 68W01 68R05 90B35 Scheduling theory Exact algorithms Complexity
ISSN:	0254-5330, 1572-9338
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!