Maximal Covering Location Problems on networks with regional demand
Abstract Covering problems are well studied in the Operations Research literature under the assumption that both the set of users and the set of potential facilities are finite. In this paper, we address the following variant, which leads to a Mixed Integer Nonlinear Program (MINLP): locations of p...
Elmentve itt :
| Szerzők: |
Blanquero Rafael Carrizosa Emilio Gazdag-Tóth Boglárka |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2016
|
| Sorozat: | OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
64 |
| doi: | 10.1016/j.omega.2015.11.004 |
| mtmt: | 2992512 |
| Online Access: | http://publicatio.bibl.u-szeged.hu/18141 |
Hasonló tételek
-
p-facility Huff location problem on networks
Szerző: Blanquero Rafael, et al.
Megjelent: (2016) -
Solving the 1-median problem on a network with continuous demand and demand surplus
Szerző: Blanquero R., et al.
Megjelent: (2023) -
Optimized location of light sources to cover a rectangular region
Szerző: Kovács Kristóf, et al.
Megjelent: (2022) -
Solving a Huff-like Stackelberg location problem on networks
Szerző: Gazdag-Tóth Boglárka, et al.
Megjelent: (2016) -
Huff-like stackelberg location problems on the plane
Szerző: Fernández José, et al.
Megjelent: (2017)