An exact exponential branch-and-merge algorithm for the single machine total tardiness problem.
Michele GarraffaLei ShangFederico Della CroceVincent T'kindtPublished in: Theor. Comput. Sci. (2018)
Keyphrases
- experimental evaluation
- learning algorithm
- cost function
- optimization algorithm
- linear complexity
- dynamic programming
- worst case
- preprocessing
- detection algorithm
- computational cost
- path planning
- matching algorithm
- improved algorithm
- theoretical analysis
- computationally efficient
- experimental study
- np hard
- single source
- similarity measure
- exact solution
- brute force
- linear programming
- multi objective
- particle swarm optimization
- clustering method
- tree structure
- classification algorithm
- high accuracy
- least squares
- scheduling problem
- computational complexity
- average case
- optimal solution
- objective function