id: 01016870
dt: j
an: 01016870
au: Righini, Giovanni
ti: Annealing algorithms for multisource absolute location problems on graph.
so: Comput. Optim. Appl. 7, No.3, 325-337 (1997).
py: 1997
pu: Springer, Norwell, MA
la: EN
cc: 
ut: annealing techniques; multisource absolute location problems on graphs
ci: 
li: doi:10.1023/A:1008612929672
ab: Summary: A methodology is presented for applying annealing techniques to
    multisource absolute location problems on graphs. 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.
rv: