Efficient Algorithms for the Capacitated 1-Median Problem

DOI10.1287/IJOC.4.4.418zbMATH Open0758.90051OpenAlexW2023086828MaRDI QIDQ4024313FDOQ4024313

Authors: Hossam ElGindy, J. Mark Keil 

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

Recommendations

• An efficient heuristic algorithm for the capacitated \(p\)-median problem
• Two exact algorithms for the capacitated \(p\)-median problem
• Efficient algorithms for the round-trip 1-center and 1-median problems
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• An Efficient Approximate Algorithm for the 1-Median Problem in Metric Spaces
• An improved approximation algorithm for the hard uniform capacitated \(k\)-median problem
• An effective VNS for the capacitated \(p\)-median problem
• Approximation Algorithms for the k-Median Problem
• Matheuristics for the capacitated p-Median problem

zbMATH Keywords

tree network1-median problemdata storage schemesum of the distances

Mathematics Subject Classification ID

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

Cited In (5)

• Efficient algorithms for the round-trip 1-center and 1-median problems
• Fast approximations for sums of distances, clustering and the Fermat-Weber problem
• Approximation and complexity of the capacitated geometric median problem
• OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
• An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs

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

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