An approximate solution method based on tabu search for k-minimum spanning tree problems.
Hideki KatagiriTomohiro HayashidaIchiro NishizakiJun IshimatsuPublished in: Int. J. Knowl. Eng. Soft Data Paradigms (2010)
Keyphrases
- tabu search
- heuristic methods
- minimum spanning tree
- variable neighborhood search
- cost function
- search algorithm
- test problems
- traveling salesman problem
- simulated annealing
- memetic algorithm
- scheduling problem
- special case
- initial solution
- genetic algorithm
- metaheuristic
- combinatorial optimization
- optimization problems
- search procedure
- quadratic assignment problem
- multidimensional knapsack problem