Heuristics for k-domination models of facility location problems in street networks

Padraig Corcoran, Andrei Gagarin

We present new greedy and beam search heuristic methods to find small-size $k$-dominating sets in graphs. The methods are inspired by a new problem formulation which explicitly hig…