A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes

DOI10.1002/nav.22023OpenAlexW3199136212MaRDI QIDQ6053130

Yanchao Liu

Publication date: 18 October 2023

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.22023

zbMATH Keywords

Voronoi diagramarea coveragelocation modeling\(p\)-center problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Geometric partitioning and robust ad-hoc network design
• Heuristics for a continuous multi-facility location problem with demand regions
• Minimum-cost load-balancing partitions
• Applications of soft computing. From theory to praxis.
• Corrections to Lee's visibility polygon algorithm
• Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
• Location covering models. History, applications and advancements
• The equitable location problem on the plane
• The Weighted Euclidean 1-Center Problem
• On the Complexity of Some Common Geometric Location Problems
• The p-Centre Problem-Heuristic and Optimal Algorithms
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• An Algorithm for the p-Center Problem in the Plane
• The p-center location problem in an area
• A Two-Sided Optimization for Theater Ballistic Missile Defense
• Solving the continuous space p-centre problem: planning application issues

This page was built for publication: A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes