A double annealing algorithm for discrete location/allocation problems
type: Item
instance of: scholarly article
title: A double annealing algorithm for discrete location/allocation problems
zbMATH Open document ID: 0914.90228
DOI: 10.1016/0377-2217(95)98957-2
author: Giovanni Righini
published in: European Journal of Operational Research
publication date: 1998-07-14T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 1175029
zbMATH Keywords: simulated annealing
zbMATH Keywords: double-annealing algorithm
zbMATH Keywords: \(P\)-median problem
describes a project that uses: VRP
MaRDI profile type: Publication
OpenAlex ID: W2101963125
cites work: Q3048611
cites work: Heuristic Methods for Location-Allocation Problems
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: A Dual-Bounded Algorithm for the p-Median Problem
cites work: Q4198056
cites work: Q3316922
cites work: An Axiomatic Approach to Location on Networks
cites work: Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median
cites work: ``Neural'' computation of decisions in optimization problems
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: Optimization by Simulated Annealing
cites work: Q3206316
cites work: Technical Note—An Algorithm for the p-Median Problem
cites work: Worst-Case and Probabilistic Analysis of a Geometric Location Problem
cites work: Annealing algorithms for multisource absolute location problems on graph
cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
description: scientific article; zbMATH DE number 1175029