A cellular heuristic for the multisource Weber problem.
type: Item
instance of: scholarly article
title: A cellular heuristic for the multisource Weber problem.
zbMATH Open document ID: 1039.90033
DOI: 10.1016/S0305-0548(02)00095-3
author: D. Massart
published in: Computers \& Operations Research
publication date: 2004-02-14T00:00:00Z
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2041848
zbMATH Keywords: Heuristic
zbMATH Keywords: Location
zbMATH Keywords: Continuous space
zbMATH Keywords: Discrete approximation
MaRDI profile type: Publication
cites work: An optimal method for solving the (generalized) multi-Weber problem
cites work: Location-Allocation Problems
cites work: Heuristic Methods for Location-Allocation Problems
cites work: Exact and approximate solutions to the multisource weber problem
cites work: A computation procedure for the exact solution of location-allocation problems with rectangular distances
cites work: Q4826162
cites work: Heuristic solution of the multisource Weber problem as a \(p\)-median problem
cites work: Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
cites work: Q4359509
cites work: A projection method for \(l_ p\) norm location-allocation problems
cites work: Constructive heuristics for the uncapacitated continuous location-allocation problem
cites work: Heuristic concentration: Two stage solution construction
description: scientific article; zbMATH DE number 2041848