In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(n tau o) respectively, where n is the number of vertices of the grid and iota is the cardinality of the path to be located. The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous spaces and network facility location. We will show that the problems presented here have a close connection with continuous dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional facilities location in the continuous case.
The location of median paths on grid graphs / Ronald I., Becker; Lari, Isabella; Scozzari, Andrea; Storchi, Giovanni. - In: ANNALS OF OPERATIONS RESEARCH. - ISSN 0254-5330. - STAMPA. - 150:1(2007), pp. 65-78.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||The location of median paths on grid graphs|
|Data di pubblicazione:||2007|
|Citazione:||The location of median paths on grid graphs / Ronald I., Becker; Lari, Isabella; Scozzari, Andrea; Storchi, Giovanni. - In: ANNALS OF OPERATIONS RESEARCH. - ISSN 0254-5330. - STAMPA. - 150:1(2007), pp. 65-78.|
|Appartiene alla tipologia:||01a Articolo in rivista|