A quantum-inspired ant colony algorithm for Steiner minimum tree problem

MaRDI QIDQ4927692zbMATH OpenFDO

Authors Xiaofeng He, Liang Ma

Publication date 20 June 2013

zbMATH Keywords

ant colony algorithmEuclidean Steiner minimum treequantum computing

Mathematics Subject Classification ID

Approximation algorithms (68W25) Quantum computation (81P68) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A quantum-inspired ant colony algorithm for graph coloring problem
• A novel quantum ant colony optimizing algorithm
• scientific article; zbMATH DE number 6311365
• A quantum ant colony algorithm for the multi-task coalition problem
• Studies on construction of the Steiner minimum tree problem based on plant growth simulation algorithm

Cited in

(4)

• A novel ant colony optimization strategy for the quantum circuit compilation problem
• scientific article; zbMATH DE number 6311365 (Why is no real title available?)
• A quantum ant colony algorithm for the multi-task coalition problem
• A quantum-inspired ant colony algorithm for graph coloring problem

This page was built for publication: A quantum-inspired ant colony algorithm for Steiner minimum tree problem

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