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

DOI10.1016/j.ejor.2016.08.038zbMath1394.90383OpenAlexW2513572874MaRDI QIDQ1752856

Gábor Nagy, Becky Callaghan, Said Salhi

Publication date: 24 May 2018

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

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

zbMATH Keywords

locationoptimal algorithmcontinuous space\(p\)-centre problem\(Z\)-maximal circles

Mathematics Subject Classification ID

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

Related Items (7)

A scalable exact algorithm for the vertex \(p\)-center problem ⋮ Continuous maximal covering location problems with interconnected facilities ⋮ The multi-period \(p\)-center problem with time-dependent travel times ⋮ 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 stratified \(p\)-center problem ⋮ An elliptical cover problem in drone delivery network design and its solution algorithms

Uses Software

• TSPLIB

Cites Work

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

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