Publication:3796940

DOI10.1287/OPRE.36.3.485zbMATH Open0651.90024OpenAlexW2156099893MaRDI QIDQ3796940FDOQ3796940

F. Radó

Publication date: 1988

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.36.3.485

zbMATH Keywords

convergence proofcontinuous location problemEuclidean multifacility location

Mathematics Subject Classification ID

Nonlinear programming (90C30) Inventory, storage, reservoirs (90B05)

Cited In (19)

• Conflict-tolerant and conflict-free multi-agent meeting
• Accelerating the convergence in the single-source and multi-source Weber problems
• An optimal method for solving the (generalized) multi-Weber problem
• The Euclidean \(k\)-supplier problem in \(\mathbb R^2\)
• A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms
• When facilities coincide: Exact optimality conditions in multifacility location
• A squared-euclidean distance location-allocation problem
• One more well-solved case of the multifacility location problem
• Clustering and the perturbed spatial median
• The Weiszfeld Algorithm: Proof, Amendments, and Extensions
• Weiszfeld's method: old and new results
• A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
• Title not available (Why is that?)
• A fixed point algorithm for solving the Euclidean multifacility location problem in a tree
• Title not available (Why is that?)
• An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree
• A globally convergent algorithm for the Euclidean multiplicity location problem
• A multifacility location problem on median spaces
• On the Euclidean assignment problem

This page was built for publication: The Euclidean Multifacility Location Problem

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