Location problems have been the focus of considerable attention both in research and practice for many years. Numerous extensions have been described to broaden its appeal and enhance its applicability. This study proposes a spreadsheet approach for three well-known facility location problems, the p-median problem (PMP), capacitated p-median (CPMP), and maximal covering location problem (MCLP)....

Hierarchical multimodal hub location problem is a cost-minimizing hub covering problem where two types of hubs and hub links, accounting for ground and air transportation, are to be established, while ensuring time-definite deliveries. We propose a mixed-integer programming formulation and perform a comprehensive sensitivity analysis on the Turkish network. We show that the locations of airport...

Recently, Chakrabarty et al. [5] initiated a systematic study of capacitated set cover problems, and considered the question of how their approximability relates to that of the uncapacitated problem on the same underlying set system. Here, we investigate this connection further and give several results, both positive and negative. In particular, we show that if the underlying set system satisfi...

Capacitated Domination generalizes the classic Dominating Set problem by specifying for each vertex a required demand and an available capacity for covering demand in its closed neighborhood. The objective is to find a minimum-sized set of vertices that can cover all of the graph’s demand without exceeding any of the capacities. In this paper we look specifically at domination with hard-capacit...