102 citations · 138 across the 4 of their papers we have counts for
4 papers
Upgrading edges in the maximal covering location problem
Marta Baldomero-Naranjo, Jörg Kalcsics, Alfredo Marín +1
We study the upgrading version of the maximal covering location problem with edge length modifications on networks. This problem aims at locating p facilities on the vertices (of t…
Minmax regret maximal covering location problems with edge demands
Marta Baldomero-Naranjo, Jörg Kalcsics, Antonio M. Rodríguez-Chía
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 on…
Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game
Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics +1
We study competitive location problems in a continuous setting, in which facilities have to be placed in a rectangular domain of normalized dimensions of and , and…
Mathematical models for stable matching problems with ties and incomplete lists
Maxence Delorme, Sergio García, Jacek Gondzio +3
We present new integer linear programming (ILP) models for NP-hard optimisation problems in instances of the Stable Marriage problem with Ties and Incomplete lists (SMTI) and its m…