Fast approximation algorithm for job sequencing with deadlines.
George GensEugene LevnerPublished in: Discret. Appl. Math. (1981)
Keyphrases
- preprocessing
- detection algorithm
- improved algorithm
- learning algorithm
- objective function
- dynamic programming
- search space
- cost function
- times faster
- k means
- computational complexity
- simulated annealing
- expectation maximization
- combinatorial optimization
- monte carlo
- tree structure
- optimization algorithm
- theoretical analysis
- high accuracy
- bayesian networks
- np hard
- randomized algorithm
- convergence rate
- recognition algorithm
- data sets
- approximation ratio
- worst case performance ratio
- classification algorithm
- computationally efficient
- input data
- worst case
- probabilistic model
- significant improvement
- similarity measure