Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem
From MaRDI portal
Publication:4407244
Recommendations
- Ant colony optimization and the minimum spanning tree problem
- Savings based ant colony optimization for the capacitated minimum spanning tree problem
- A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems
- Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm
- A tabu search heuristic for the generalized minimum spanning tree problem
Cited in
(11)- A rapid learning automata-based approach for generalized minimum spanning tree problem
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- The prize-collecting generalized minimum spanning tree problem
- Ant colony optimization for the cell assignment problem in PCS networks
- A TWO-STATE ANT COLONY ALGORITHM FOR SOLVING THE MINIMUM GRAPH BISECTION PROBLEM
- A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems
- Search tree-based approach for the \(p\)-median problem using the ant colony optimization algorithm
- An introduction to learning automata and optimization
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
- Upper and lower bounding strategies for the generalized minimum spanning tree problem
- Ant colony optimization and the minimum spanning tree problem
This page was built for publication: Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4407244)