A branch-and-cut algorithm for the Edge Interdiction Clique Problem.
Fabio FuriniIvana LjubicPablo San SegundoYanlu ZhaoPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- high accuracy
- detection algorithm
- objective function
- computational complexity
- preprocessing
- times faster
- np hard
- dynamic programming
- learning algorithm
- edge detection algorithm
- max min
- simulated annealing
- improved algorithm
- matching algorithm
- segmentation algorithm
- expectation maximization
- computational cost
- k means
- search space
- optimal solution
- linear programming
- worst case
- theoretical analysis
- optimization algorithm
- experimental evaluation
- clustering method
- segmentation method
- cost function
- maximum flow
- maximum weight
- similarity measure