Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game

Autor: Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist

Publikováno v: Annals of Operations Research. 321:79-101

We study competitive location problems in a continuous setting, in which facilities have to be placed in a rectangular domain $R$ of normalized dimensions of $1$ and $\rho\geq 1$, and distances are measured according to the Manhattan metric. We show

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9e896bae76edf03e3735e69b8f6075f5
https://doi.org/10.1007/s10479-022-04976-x

Conditional facility location problems with continuous demand and a polygonal barrier

Autor: Jörg Kalcsics, Thomas Byrne

Publikováno v: Byrne, T & Kalcsics, J 2021, ' Conditional Facility Location Problems with Continuous Demand and a Polygonal Barrier ', European Journal of Operational Research . https://doi.org/10.1016/j.ejor.2021.02.032

We consider facility location problems where n facilities are present in a convex polygon in the rectilinear plane, over which continuous and uniform demand is distributed and within which a convex polygonal barrier is located (removing all demand an

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4980604f6547b42b5a5c44a1106957a9
https://doi.org/10.1016/j.ejor.2021.02.032

Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams

Autor: Igor Averbakh, Oded Berman, Dmitry Krass, Jörg Kalcsics

Publikováno v: Averbakh, I, Bermany, O, Kalcsics, J & Krassx, D 2021, ' Location Problems with Continuous Demand and Unreliable Facilities: Applications of Families of Incremental Voronoi Diagrams ', Discrete Applied Mathematics, vol. 300, pp. 36-55 . https://doi.org/10.1016/j.dam.2021.05.002

We consider conditional facility location problems with unreliable facilities that can fail with known probabilities. The demand is uniformly distributed over a convex polygon in the rectilinear plane where a number of facilities are already present,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::25ec5a0bc39716e4a4a790dba633689e
https://doi.org/10.1016/j.dam.2021.05.002

Minmax Regret Maximal Covering Location Problems with Edge Demands

Autor: Jörg Kalcsics, Marta Baldomero-Naranjo, Antonio M. Rodríguez-Chía

Publikováno v: Baldomero-Naranjo, M, Kalcsics, J & Rodríguez-Chía, A M 2021, ' Minmax Regret Maximal Covering Location Problems with Edge Demands ', Computers and Operations Research, vol. 130, 105181 . https://doi.org/10.1016/j.cor.2020.105181

This paper addresses a version of the single-facility Maximal Covering Location Problem on a network where the demand is: (i) distributed along the edges and (ii) uncertain with only a known interval estimation. To deal with this problem, we propose

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bbd56956090d1bbac998d68a209428f4
https://www.pure.ed.ac.uk/ws/files/195914129/COR_paper_preprint.pdf

Improved instance generation for kidney exchange programmes

Autor: Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David Manlove, William Pettersson, James Trimble

Publikováno v: Computers and Operations Research, 141:105707. Elsevier Limited
Delorme, M, Garcia, S, Gondzio, J, Kalcsics, J, Manlove, D, Pettersson, W & Trimble, J 2022, ' Improved instance generation for kidney exchange programmes ', Computers and Operations Research, vol. 141, 105707 . https://doi.org/10.1016/j.cor.2022.105707

Kidney exchange programmes increase the rate of living donor kidney transplants, and operations research techniques are vital to such programmes. These techniques, as well as changes to policy regarding kidney exchange programmes, are often tested us

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a44a9e078a071de9405076bc124531d3
https://doi.org/10.1016/j.cor.2022.105707