A branch-and-cut algorithm for scheduling of projects with variable-intensity activities.
Tamás KisPublished in: Math. Program. (2005)
Keyphrases
- dynamic programming
- learning algorithm
- times faster
- expectation maximization
- improved algorithm
- recognition algorithm
- detection algorithm
- computational complexity
- significant improvement
- cost function
- np hard
- convergence rate
- experimental evaluation
- probabilistic model
- worst case
- preprocessing
- matching algorithm
- clustering method
- segmentation algorithm
- simulated annealing
- search space
- theoretical analysis
- k means
- particle swarm optimization
- input data
- energy function
- data structure
- optimal solution
- data sets