Solving nonconvex planar location problems by finite dominating sets

  • It is well-known that some of the classical location problems with polyhedral gauges can be solved in polynomial time by finding a finite dominating set, i.e. a finite set of candidates guaranteed to contain at least one optimal location. In this paper it is first established that this result holds for a much larger class of problems than currently considered in the literature. The model for which this result can be proven includes, for instance, location problems with attraction and repulsion, and location-allocation problems. Next, it is shown that the approximation of general gauges by polyhedral ones in the objective function of our general model can be analyzed with regard to the subsequent error in the optimal objective value. For the approximation problem two different approaches are described, the sandwich procedure and the greedy algorithm. Both of these approaches lead - for fixed epsilon - to polynomial approximation algorithms with accuracy epsilon for solving the general model considered in this paper.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Emilio Carrizosa, Horst W. Hamacher, Rolf Klein, Stefan Nickel
URN (permanent link):urn:nbn:de:hbz:386-kluedo-9407
Serie (Series number):Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) (18)
Document Type:Preprint
Language of publication:English
Year of Completion:2000
Year of Publication:2000
Publishing Institute:Fraunhofer-Institut für Techno- und Wirtschaftsmathematik
Tag:Approximation ; Continuous Location ; Finite Dominating Sets ; Greedy Algorithm; Polyhedral Gauges ; Sandwich Algorithm
Faculties / Organisational entities:Fraunhofer (ITWM)
DDC-Cassification:510 Mathematik

$Rev: 12793 $