Pages that link to "Item:Q3652111"
From MaRDI portal
The following pages link to A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems (Q3652111):
Displaying 6 items.
- A hybrid of max-min ant system and linear programming for the \(k\)-covering problem (Q342539) (← links)
- A rapid learning automata-based approach for generalized minimum spanning tree problem (Q2023120) (← links)
- Savings based ant colony optimization for the capacitated minimum spanning tree problem (Q2581619) (← links)
- A memetic algorithm based on tabu search for \(k\)-cardinality tree problems (Q2794969) (← links)
- Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem (Q4407244) (← links)
- Restricted swap-based neighborhood search for the minimum connected dominating set problem (Q4565786) (← links)