Speeding up the optimal method of Drezner for the p-centre problem in the plane

DOI10.1016/J.EJOR.2016.08.038MaRDI QIDQ1752856zbMATH OpenOpenAlexFDO

Authors Becky Callaghan, Said Salhi, Gábor Nagy

Publication date 24 May 2018

Published in European Journal of Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.ejor.2016.08.038

zbMATH Keywords

\(p\)-centre problem\(Z\)-maximal circlescontinuous spacelocationoptimal algorithm

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Drezner's exact method for the continuous \(p\)-centre problem revisited
• An Algorithm for the p-Center Problem in the Plane
• On the complexity of the \((r|p)\)-centroid problem in the plane
• An optimal approximation algorithm for the rectilinear m-center problem
• scientific article; zbMATH DE number 1285629
• A near-linear algorithm for the planar 2-center problem
• A near-linear algorithm for the planar segment-center problem
• A new formulation and resolution method for the p-center problem
• A new alternating heuristic for the \((r|p)\)-centroid problem on the plane

Cites work

• A new formulation and resolution method for the p-center problem
• A relaxation-based algorithm for solving the conditional \(p\)-center problem
• Continuous center problems
• Dominant, an algorithm for the \(p\)-center problem.
• Heuristic Methods for Location-Allocation Problems
• scientific article; zbMATH DE number 1803755 (Why is no real title available?)
• scientific article; zbMATH DE number 4059089 (Why is no real title available?)
• scientific article; zbMATH DE number 219845 (Why is no real title available?)
• New algorithms for \(k\)-center and extensions
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
• On the Complexity of Some Common Geometric Location Problems
• Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
• Solving the continuous space p-centre problem: planning application issues
• Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
• The m-Center Problem
• The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory
• The p-Centre Problem-Heuristic and Optimal Algorithms

Cited in

(11)

• A scalable exact algorithm for the vertex \(p\)-center problem
• The stratified p-center problem
• An elliptical cover problem in drone delivery network design and its solution algorithms
• Continuous maximal covering location problems with interconnected facilities
• The multi-period \(p\)-center problem with time-dependent travel times
• An adaptive perturbation-based heuristic: an application to the continuous p-centre problem
• A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes
• Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities
• The obnoxious facilities p-center problem with forbidden regions
• Dispersed starting solutions in facility location: the case of the planar p-median problem
• Analyzing location models by the maximum possible value of perfect information

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane

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