Discrete network location models.

*(English)*Zbl 1061.90070
Drezner, Zvi (ed.) et al., Facility location. Applications and theory. Berlin: Springer (ISBN 3-540-42172-6/hbk). 81-118 (2002).

The contribution contains a broad overview of network location problems, in which facilities are allowed to be located only at sites of a finite set of candidates. The sequence of studied problems starts with set covering problem and continues over maximal covering location problem, \(p\)-center problem, \(p\)-dispersion problem and \(p\)-mediand problems to the family of fixed charge location problems. This family includes both capacitated and uncapacitated facility location problems as well as hub location and minisum location problems. The authors build an integer linear programming model for each of these problems and provide a concise explanation of their possible application in practice together with extensive references to relevant works. In the last but one section they outline principles of methods, which may solve the location problems. Greedy and improvement heuristics are reported here as well as the metaheuristic tabu search and the Lagrangian relaxation approach. In the concluding section the perspectives of this scientific area are analysed and further development outlined.

For the entire collection see [Zbl 0988.00044].

For the entire collection see [Zbl 0988.00044].

Reviewer: Jaroslav Janáček (Žilina)

##### MSC:

90B80 | Discrete location and assignment |

90B10 | Deterministic network models in operations research |

90-02 | Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming |

90C59 | Approximation methods and heuristics in mathematical programming |

90C10 | Integer programming |