A generalized Weiszfeld method for the multi-facility location problem (Q974995)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	A generalized Weiszfeld method for the multi-facility location problem	scientific article

Statements

scholarly article

A generalized Weiszfeld method for the multi-facility location problem (English)

Operations Research Letters

publication date

8 June 2010

zbMATH Keywords

Fermat-Weber location problem

multi-facility location problem

decomposition method

probabilistic assignments

Weiszfeld method

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.orl.2009.11.005

Iterative Minimization Schemes for Solving the Single Source Localization Problem

Probabilistic d-clustering

Further notes on convergence of the Weiszfeld algorithm

Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem

Heuristic Methods for Location-Allocation Problems

The gravity \(p\)-median model

Solving the multiple competitive facilities location problem

A note on the Weber location problem

Weber's problem and weiszfeld's algorithm in general spaces

PROBABILISTIC DISTANCE CLUSTERING ADJUSTED FOR CLUSTER SIZE

Contour approximation of data: a duality theory

A note on Fermat's problem

On Information and Sufficiency

A heuristic method for large-scale multi-facility location problems

On the Complexity of Some Common Geometric Location Problems

On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem

A modified Weiszfeld algorithm for the Fermat-Weber location problem

Identifiers

zbMATH Open document ID

10.1016/j.orl.2009.11.005

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:974995

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q974995&oldid=35173317"