New facets and a branch-and-cut algorithm for the weighted clique problem.
Michael M. SørensenPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- optimal solution
- dynamic programming
- k means
- computational complexity
- times faster
- detection algorithm
- improved algorithm
- computational cost
- learning algorithm
- matching algorithm
- linear programming
- computationally efficient
- theoretical analysis
- search space
- significant improvement
- objective function
- high accuracy
- maximum weight
- combinatorial optimization
- weighted distance
- worst case
- path planning
- optimization algorithm
- simulated annealing
- experimental evaluation
- cost function
- preprocessing
- search algorithm
- video sequences
- similarity measure