On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints.
An ZhangPublished in: Oper. Res. Lett. (2015)
Keyphrases
- learning algorithm
- optimal solution
- dynamic programming
- preprocessing
- linear programming
- recognition algorithm
- optimization algorithm
- objective function
- passive aggressive
- computational complexity
- worst case
- cost function
- detection algorithm
- significant improvement
- np hard
- particle swarm optimization
- constrained optimization
- exhaustive search
- expectation maximization
- segmentation algorithm
- combinatorial optimization
- convergence rate
- multiple constraints