Addou, El Houcine, Serghini, Abelhafid, Bekkaye, El (2021) Hybrid Approaches based on Simulated Annealing, Tabu Search and Ant Colony Optimization for Solving the k-Minimum Spanning Tree Problem. International Journal of Advanced Computer Science and Applications, 12 (2) doi:10.14569/ijacsa.2021.0120288
| Reference Type | Journal (article/letter/editorial) | ||
|---|---|---|---|
| Title | Hybrid Approaches based on Simulated Annealing, Tabu Search and Ant Colony Optimization for Solving the k-Minimum Spanning Tree Problem | ||
| Journal | International Journal of Advanced Computer Science and Applications | ||
| Authors | Addou, El Houcine | Author | |
| Serghini, Abelhafid | Author | ||
| Bekkaye, El | Author | ||
| Year | 2021 | Volume | 12 |
| Issue | 2 | ||
| Publisher | The Science and Information Organization | ||
| DOI | doi:10.14569/ijacsa.2021.0120288Search in ResearchGate | ||
| Generate Citation Formats | |||
| Mindat Ref. ID | 13258375 | Long-form Identifier | mindat:1:5:13258375:8 |
| GUID | 0 | ||
| Full Reference | Addou, El Houcine, Serghini, Abelhafid, Bekkaye, El (2021) Hybrid Approaches based on Simulated Annealing, Tabu Search and Ant Colony Optimization for Solving the k-Minimum Spanning Tree Problem. International Journal of Advanced Computer Science and Applications, 12 (2) doi:10.14569/ijacsa.2021.0120288 | ||
| Plain Text | Addou, El Houcine, Serghini, Abelhafid, Bekkaye, El (2021) Hybrid Approaches based on Simulated Annealing, Tabu Search and Ant Colony Optimization for Solving the k-Minimum Spanning Tree Problem. International Journal of Advanced Computer Science and Applications, 12 (2) doi:10.14569/ijacsa.2021.0120288 | ||
| In | (2021) International Journal of Advanced Computer Science and Applications Vol. 12 (2) The Science and Information Organization | ||
See Also
These are possibly similar items as determined by title/reference text matching only.
