Efficient Algorithms for the Capacitated 1-Median Problem

DOI10.1287/ijoc.4.4.418zbMath0758.90051OpenAlexW2023086828MaRDI QIDQ4024313

J. Mark Keil, Hossam ElGindy

Publication date: 25 February 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.4.4.418

zbMATH Keywords

tree network1-median problemdata storage schemesum of the distances

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS ⋮ Fast approximations for sums of distances, clustering and the Fermat-Weber problem ⋮ Approximation and complexity of the capacitated geometric median problem

This page was built for publication: Efficient Algorithms for the Capacitated 1-Median Problem