A Hybrid Branch-And-Cut Algorithm for the One-Machine Scheduling Problem.
Ruslan SadykovPublished in: CPAIOR (2004)
Keyphrases
- np hard
- learning algorithm
- worst case
- scheduling problem
- optimization algorithm
- significant improvement
- search space
- preprocessing
- cost function
- dynamic programming
- improved algorithm
- optimal solution
- times faster
- detection algorithm
- expectation maximization
- recognition algorithm
- computational cost
- experimental evaluation
- benchmark problems
- search algorithm
- segmentation algorithm
- k means
- computational complexity
- matching algorithm
- parallel genetic algorithm
- single machine
- linear programming
- high accuracy
- neural network
- evolutionary algorithm