Annealing Algorithms for Multisource Absolute Location Problems on Graph

  • Authors:
  • Giovanni Righini

  • Affiliations:
  • Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo da Vinci, 32, 20133 Milano, Italy

  • Venue:
  • Computational Optimization and Applications
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

A methodology is presented for applying annealing techniques tomultisource absolute location problems on graph. Two kinds ofobjective functions are considered: barycenters and centers. Aclass of new algorithms is described: its development startsfrom the iterative “cluster-and-locate” algorithm and reliesupon the relaxation of the integrality constraints onallocation variables. Experimental results are reported.