Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
type: Item
instance of: scholarly article
title: Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
zbMATH Open document ID: 1327.90091
published in: Journal of Global Optimization
publication date: 2015-10-28T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6499557
zbMATH Keywords: variable neighbourhood search
zbMATH Keywords: location problem
zbMATH Keywords: aggregation
zbMATH Keywords: \(p\)-median
author: Chandra Ade Irawan
author: Said Salhi
MaRDI profile type: Publication
full work available at URL: s10898-013-0080-z
OpenAlex ID: W1977463930
cites work: An aggregation heuristic for large scale p-median problem
cites work: Analysis of aggregation errors for the \(p\)-median problem
cites work: Row-Column Aggregation for Rectilinear Distance p-Median Problems
cites work: Aggregation error for location models: Survey and analysis
cites work: Solving large \(p\)-median problems with a radius formulation
cites work: Variable neighborhood search for the p-median
cites work: Data surrogation error in \(p\)-median models
cites work: Q4229609
cites work: Worst-Case and Probabilistic Analysis of a Geometric Location Problem
cites work: Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem
cites work: A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
cites work: A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
DOI: 10.1007/S10898-013-0080-Z
description: scientific article; zbMATH DE number 6499557