Re-aggregation heuristic for large p-median problems

DOI10.1007/978-3-319-27680-9_4zbMATH Open1367.90121OpenAlexW2290483089MaRDI QIDQ5281602FDOQ5281602

Authors: Matej Cebecauer, L'uboš Buzna 

Publication date: 26 July 2017

Published in: Operations Research and Enterprise Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27680-9_4

Recommendations

• An aggregation heuristic for large scale p-median problem
• Row-Column Aggregation for Rectilinear Distance p-Median Problems
• Analysis of aggregation errors for the \(p\)-median problem
• On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
• Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search

zbMATH Keywords

\(p\)-median problemre-aggregation heuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cited In (4)

• An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
• Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
• A quadtree-based allocation method for a class of large discrete Euclidean location problems
• An aggregation heuristic for large scale p-median problem

Uses Software

• OpenStreetMap

This page was built for publication: Re-aggregation heuristic for large p-median problems

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