Annealing algorithms for multisource absolute location problems on graph

DOI10.1023/A:1008612929672MaRDI QIDQ1356068zbMATH OpenFDO

Authors Giovanni Righini

Publication date 4 June 1997

Published in Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

annealing techniquesmultisource absolute location problems on graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 1253067
• A double annealing algorithm for discrete location/allocation problems
• scientific article; zbMATH DE number 7234705
• scientific article; zbMATH DE number 49060
• On multi-dimensional annealing problems
• Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
• Annealing-based algorithm for solving CVP and SVP
• Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
• A deterministic annealing algorithm for approximating a solution of the min-bisection problem
• APPLYING SIMULATED ANNEALING TO THE MULTIDIMENSIONAL ASSIGNMENT PROBLEM

Cited in

(2)

• scientific article; zbMATH DE number 7234705 (Why is no real title available?)
• A double annealing algorithm for discrete location/allocation problems

This page was built for publication: Annealing algorithms for multisource absolute location problems on graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356068)