METODA COLONIILOR DE FURNICI PENTRU PROBLEMA P-CENTRULUI UNUI GRAF

Andrei POŞTARU Catedra Informatică şi Optimizare Discretă

Authors

  • USM ADMIN

Abstract

We propose an algorithm based of the Ant Colony Optimization (ACO) metaheuristic for solving the p-center problem of a non-directed graph.

Downloads

Published

2010-11-24

Issue

No. 7 (2010)

Section

Articles