“…Evidently, the quantity
has a direct impact on the execution time of any solution algorithm, whereby, according to complexity theory, the general problem of finding the optimal locations of
facilities in a graph with
vertices is NP‐hard . Surveys concerning multiple facility location problems can be found, for example, in Daneshzand and Shoeleh (
2009) or Reese (
2006).
- Capacitated versus uncapacitated location problems : While in elementary location‐allocation problems, the capacities of all facilities are assumed to be unrestricted, advanced models overcome this apparent shortcoming by incorporating additional constraints concerning individual capacity limitations of the facilities.
…”