Annealing algorithms for multisource absolute location problems on graph

A methodology is presented for applying annealing techniques to multisource absolute location problems on graph. Two kinds of objective functions are considered: barycenters and centers. A class of new algorithms is described: its development starts from the iterative ‘cluster-and-locate’ algorithm and relies upon the relaxation of the integrality constraints on allocation variables. Experimental results are reported.