The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm.
Temel ÖncanAbraham P. PunnenPublished in: Comput. Oper. Res. (2010)
Keyphrases
- lower bounding
- search algorithm
- branch and bound algorithm
- lower bound
- dynamic time warping
- multi step
- branch and bound
- upper bounding
- mathematical programming
- similarity search
- lower and upper bounds
- objective function
- tabu search
- euclidean distance
- upper bound
- computational complexity
- edit distance
- np hard
- pairwise
- combinatorial optimization
- complex objects
- scheduling problem
- search space
- data streams
- genetic algorithm