A best possible online algorithm for minimizing the total completion time and the total soft penalty cost.
Ran MaJuannian XuYuzhong ZhangPublished in: Optim. Lett. (2024)
Keyphrases
- optimization algorithm
- dynamic programming
- times faster
- improved algorithm
- computational cost
- travel cost
- detection algorithm
- experimental evaluation
- matching algorithm
- high accuracy
- worst case
- space complexity
- cost function
- k means
- computational complexity
- similarity measure
- objective function
- transportation problem
- clustering method
- computationally efficient
- theoretical analysis
- tree structure
- expectation maximization
- online learning
- recognition algorithm
- probabilistic model
- np hard
- significant improvement
- optimal solution