A quadtree-based allocation method for a class of large discrete Euclidean location problems

DOI10.1016/j.cor.2014.10.002zbMath1348.90418OpenAlexW2053155457MaRDI QIDQ337393

Said Salhi, Chandra Ade Irawan

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://kar.kent.ac.uk/45782/1/COR%28final%29.pdf

zbMATH Keywords

aggregation\(p\)-median and \(p\)-center problemsallocation methodquadtree method

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (1)

Demand point aggregation method for covering problems with gradual coverage

Cites Work

• Unnamed Item
• On worst-case aggregation analysis for network location problems
• Solving continuous location-districting problems with Voronoi diagrams
• Variable neighbourhood search: methods and applications
• Aggregation error for location models: Survey and analysis
• Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem
• Analysis of aggregation errors for the \(p\)-median problem
• The demand partitioning method for reducing aggregation errors in \(p\)-median problems
• Aggregation and surrogation error in the \(p\)-median model
• An aggregation heuristic for large scale p-median problem
• An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
• Solving Large p-Median Problems with a Radius Formulation
• Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems
• Aggregation Error Bounds for a Class of Location Models
• Row-Column Aggregation for Rectilinear Distance p-Median Problems

This page was built for publication: A quadtree-based allocation method for a class of large discrete Euclidean location problems