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

Full description

Saved in:

Bibliographic Details
Published in:	Annals of operations research Vol. 343; no. 2; pp. 753 - 783
Main Authors:	T’kindt, Vincent, Della Croce, Federico, Liedloff, Mathieu
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.12.2024 Springer Springer Nature B.V Springer Verlag
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!