Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm

DOI10.1155/2015/601782zbMath1394.90581OpenAlexW1722002583WikidataQ59119522 ScholiaQ59119522MaRDI QIDQ1666108

Hua Su, Cheng Chang, Chuitian Rong, Xue-Mei Sun

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/601782

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Ant colony optimization and the minimum spanning tree problem
• Edge exchanges in the degree-constrained minimum spanning tree problem
• A Lagrangean approach to the degree-constrained minimum spanning tree problem
• Ant colony optimization theory: a survey
• A branch and cut method for the degree-constrained minimum spanning tree problem
• EPIDEMICS OF SIRS MODEL WITH NONUNIFORM TRANSMISSION ON SCALE-FREE NETWORKS
• HETEROGENEOUS LINK WEIGHT PROMOTES THE COOPERATION IN SPATIAL PRISONER'S DILEMMA
• A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
• Comparison of algorithms for the degree constrained minimum spanning tree

This page was built for publication: Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm