Rectilinear m -Center problem

DOI10.1002/NAV.3800370306zbMATH Open0692.90039OpenAlexW2106886203MaRDI QIDQ3035110FDOQ3035110

Authors:

Publication date: 1990

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800370306

zbMATH Keywords

rectilinear distanceunweighted m-center problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Inventory, storage, reservoirs (90B05)

Cites Work

• The Weighted Euclidean 1-Center Problem
• Linear Programming in Linear Time When the Dimension Is Fixed
• On the rectangularp-center problem
• Single Facility $l_p $-Distance Minimax Location
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• The p-Centre Problem-Heuristic and Optimal Algorithms

Cited In (4)

• A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem
• Optimized location of light sources to cover a rectangular region
• On weighted rectilinear 2-center and 3-center problems
• Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance

This page was built for publication: Rectilinear m -Center problem

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