Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
type: Item
instance of: scholarly article
title: Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
zbMATH Open document ID: 1381.90043
author: Zvi Drezner
author: Said Salhi
published in: Annals of Operations Research
publication date: 2017-12-15T00:00:00Z
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6819038
zbMATH Keywords: planar \(p\)-median
zbMATH Keywords: local search
zbMATH Keywords: neighborhood reduction
zbMATH Keywords: metaheuristics
describes a project that uses: TSPLIB
describes a project that uses: BEAMR
describes a project that uses: GLOB
MaRDI profile type: Publication
full work available at URL: s10479-015-1961-y
OpenAlex ID: W1144451890
cites work: Big segment small segment global optimization algorithm on networks
cites work: A projection method for \(l_ p\) norm location-allocation problems
cites work: A new heuristic for solving the \(p\)-median problem in the plane
cites work: A new local search for continuous location problems
cites work: Decomposition strategies for large-scale continuous location–allocation problems
cites work: Q3598873
cites work: Solution of the multisource Weber and conditional Weber problems by d. -c. programming
cites work: A tree search algorithm for the p-median problem
cites work: COBRA: A new formulation of the classic \(p\)-median location problem
cites work: BEAMR: an exact and approximate model for the \(p\)-median problem
cites work: Location-Allocation Problems
cites work: Heuristic Methods for Location-Allocation Problems
cites work: New heuristic algorithms for solving the planar \(p\)-median problem
cites work: New local searches for solving the multi-source Weber problem
cites work: The Facility Location Problem with Limited Distances
cites work: The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
cites work: Solving large \(p\)-median problems with a radius formulation
cites work: Implementing vehicle routing algorithms
cites work: Variable neighborhood search for the p-median
cites work: On the Complexity of Some Common Geometric Location Problems
cites work: General variable neighborhood search for the continuous optimization
cites work: Variable neighborhood search
cites work: An Efficient Method for the Multi-Depot Location-Allocation Problem
cites work: GBSSS: The generalized big square small square method for planar single- facility location
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Heuristic concentration: Two stage solution construction
cites work: An optimal method for solving the (generalized) multi-Weber problem
cites work: A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
cites work: The big cube small cube solution method for multidimensional facility location problems
cites work: Heuristic methods for large centroid clustering problems
DOI: 10.1007/S10479-015-1961-Y
description: scientific article; zbMATH DE number 6819038