Abstract: Highlights•A robust version of the maximum capture problem under random utility models.•Facility utilities are not certainly known.•The worst-case objective function is monotonic increasing and submodular.•Outer-approximation and local search algorithms with guarantees.•Experiments with instances from the multinomial logit and nested logit models.
External IDs:dblp:journals/eor/DamTM23
Loading