A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem.
Günes ErdoganJean-François CordeauGilbert LaportePublished in: Discret. Appl. Math. (2010)
Keyphrases
- experimental evaluation
- learning algorithm
- np hard
- significant improvement
- computational cost
- objective function
- k means
- matching algorithm
- detection algorithm
- computational complexity
- preprocessing
- gradient projection
- recognition algorithm
- combinatorial optimization
- high accuracy
- worst case
- optimal solution
- neural network
- cost function
- simulated annealing
- expectation maximization
- optimization algorithm
- search algorithm
- tabu search
- similarity measure
- convergence rate
- single machine
- image segmentation
- clustering algorithm