Tabu Search Algorithm Based on Strategic Oscillation for Nonlinear Minimum Spanning Tree Problems

DOI10.1007/978-0-387-74905-1_33zbMATH Open1154.90508OpenAlexW44006602MaRDI QIDQ3606074FDOQ3606074

Authors: Hideki Katagiri, Masatoshi Sakawa, Kosuke Kato, Ichiro Nishizaki, Takeshi Uno, Tomohiro Hayashida 

Publication date: 26 February 2009

Published in: Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-74905-1_33

Recommendations

• Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems
• A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems
• Solving the quadratic minimum spanning tree problem
• A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
• The multi-criteria minimum spanning tree problem based genetic algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Search theory (90B40)

Cited In (2)

• Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
• Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems

This page was built for publication: Tabu Search Algorithm Based on Strategic Oscillation for Nonlinear Minimum Spanning Tree Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3606074)