Planar maximum coverage location problem with partial coverage and rectangular demand and service zones
Year of publication: |
2017
|
---|---|
Authors: | Bansal, Manish ; Kianfar, Kiavash |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 29.2017, 1, p. 152-169
|
Subject: | partial coverage | planar maximum covering location problem | rectilinear distance | facility location | rectangle positioning | planar p-center problem | NP-hard | branch and bound | Betriebliche Standortwahl | Firm location choice | Mathematische Optimierung | Mathematical programming | Standorttheorie | Location theory | Branch-and-Bound | Branch and Bound |
-
A branch-and-bound algorithm for the maximum capture problem with random utilities
Freire, Alexandre S., (2016)
-
A separation algorithm for the simple plant location problem
Galli, Laura, (2021)
-
Locating sensors to observe network arc flows : exact and heuristic approaches
Bianco, L., (2014)
- More ...
-
Kianfar, Kiavash, (2010)
-
An efficient model for the crosscut optimisation problem in a wood processing mill
Fathi, Yahya, (2012)
-
Kianfar, Kiavash, (2010)
- More ...