On the overlap area of a disk and a piecewise circular domain

DOI10.1016/j.cor.2018.11.007zbMath1458.90422OpenAlexW2901938761MaRDI QIDQ1725599

Marta Fort, Narcís Coll, J. Antoni Sellarès

Publication date: 14 February 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.11.007

zbMATH Keywords

decision support systemsgraphics processing unit (GPU)continuous spacefacility placementservice coverage

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Continuous space maximal coverage: insights, advances and challenges
• Generalized coverage: new developments in covering location models
• A Lagrangean heuristic for the maximal covering location problem
• Computing approximate solutions of the maximum covering problem with GRASP
• The gradual covering decay location problem on a network.
• Dual-based heuristics for a hierarchical covering location problem
• A maximal covering location model in the presence of partial coverage
• Shape matching under rigid motion
• Finding a guard that sees most and a shop that sells most
• Solving the maximal covering location problem with heuristic concentration
• The gradual covering problem
• The Maximum Coverage Location Problem
• Replacing continuous demand with discrete demand in a competitive location model
• An exact algorithm for the maximal covering problem
• Covering Problems
• Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones
• The generalized maximal covering location problem

This page was built for publication: On the overlap area of a disk and a piecewise circular domain