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

DOI10.1016/J.COR.2014.10.002zbMATH Open1348.90418OpenAlexW2053155457MaRDI QIDQ337393FDOQ337393

Authors: 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

Recommendations

• Re-aggregation heuristic for large p-median problems
• A continuous analysis framework for the solution of location-allocation problems with dense demand
• Heuristic cluster algorithm for multiple facility location-allocation problem
• Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem
• A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand

zbMATH Keywords

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

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Variable neighbourhood search: methods and applications
• Solving large \(p\)-median problems with a radius formulation
• Aggregation error for location models: Survey and analysis
• An aggregation heuristic for large scale p-median problem
• 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 adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
• Title not available (Why is that?)
• 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
• On worst-case aggregation analysis for network location problems
• Solving continuous location-districting problems with Voronoi diagrams

Cited In (2)

• Demand point aggregation method for covering problems with gradual coverage
• A quadtree approach based on European geographic grids: reconciling data privacy and accuracy

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

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