Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones

DOI10.1287/ijoc.2016.0722zbMath1364.90285OpenAlexW2562672378MaRDI QIDQ5739137

Kiavash Kianfar, Manish Bansal

Publication date: 2 June 2017

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/805bc5a6e6f6cc9f6a53d4aca91d240919928936

zbMATH Keywords

branch and boundNP-hardfacility locationpartial coveragerectilinear distanceplanar \(p\)-center problemplanar maximum covering location problemrectangle positioning

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

Upgrading edges in the maximal covering location problem, The concept of modeling packing and covering problems using modern computational geometry software, Efficient presolving methods for solving maximal covering and partial set covering location problems, On the overlap area of a disk and a piecewise circular domain, A practical heuristic for maximum coverage in large-scale continuous location problem, Orientational variable-length strip covering problem: a branch-and-price-based algorithm, New exact algorithms for planar maximum covering location by ellipses problems, Lattice coverage of cuboid with minimum number of hemispheres