A branch-and-cut algorithm for the preemptive swapping problem.
Charles BordenaveMichel GendreauGilbert LaportePublished in: Networks (2012)
Keyphrases
- experimental evaluation
- learning algorithm
- high accuracy
- theoretical analysis
- computational complexity
- search space
- detection algorithm
- cost function
- scheduling problem
- dynamic programming
- times faster
- recognition algorithm
- optimization algorithm
- significant improvement
- k means
- preprocessing
- objective function
- improved algorithm
- computationally efficient
- input data
- worst case
- computational cost
- np hard
- expectation maximization
- segmentation algorithm
- experimental study
- tree structure
- matching algorithm
- artificial neural networks