A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems

DOI10.1007/978-3-642-04820-3_29zbMath1273.68349OpenAlexW1601702010MaRDI QIDQ3652111

Hideki Katagiri, Tomohiro Hayashida, Jun Ishimatsu, Ichiro Nishizaki

Publication date: 17 December 2009

Published in: Modeling Decisions for Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04820-3_29

zbMATH Keywords

tabu searchapproximate solutionant colony optimizationhybrid algorithm\(k\)-minimum spanning tree

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

This page was built for publication: A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems