METODA COLONIILOR DE FURNICI PENTRU PROBLEMA P-CENTRULUI UNUI GRAF

METODA COLONIILOR DE FURNICI PENTRU PROBLEMA P-CENTRULUI UNUI GRAF

Poștaru, Andrei
URI: http://studiamsu.eu/nr-7-37-2010/
http://dspace.usm.md:8080/xmlui/handle/123456789/4379
Date: 2010

Abstract:

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

Show full item record

Files in this item

Icon
Name: 05.-p.32-36.pdf
Size: 349.5Kb
Format: PDF
View/Open

This item appears in the following Collection(s)

Search DSpace


Advanced Search

Browse

My Account