Similarly, using Bender's decomposition is needed: even for moderate values of K (2 to 3), the K-adaptability MILP (5) could not be loaded in memory.
to the best of our knowledge, ours is the first paper enforcing fairness constraints in the context of graph covering subject to node failure.