dc.creator | Carrizosa Priego, Emilio José | es |
dc.creator | Hamacher, Horst W. | es |
dc.creator | Klein, Rolf | es |
dc.creator | Nickel, Stefan | es |
dc.date.accessioned | 2016-12-09T10:58:42Z | |
dc.date.available | 2016-12-09T10:58:42Z | |
dc.date.issued | 2000-10 | |
dc.identifier.citation | Carrizosa Priego, E.J., Hamacher, H.W., Klein, R. y Nickel, S. (2000). Solving nonconvex planar location problems by nite dominating sets. Journal of Global Optimization, 18 (2), 195-210. | |
dc.identifier.issn | 0925-5001 | es |
dc.identifier.issn | 1573-2916 | es |
dc.identifier.uri | http://hdl.handle.net/11441/49901 | |
dc.description.abstract | It is well-known that some of the classical location problems with polyhedral
gauges can be solved in polynomial time by nding a fi nite dominating set, i.e. a finite set of candidates guaranteed to contain at least one optimal location.
In this paper it is fi rst 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 ob jective value. For the approximation
problem two di erent approaches are described, the sandwich procedure and the greedy algorithm. Both of these approaches lead - for fixed e - to polynomial approximation algorithms with accuracy for solving the
general model considered in this paper. | es |
dc.description.sponsorship | Dirección General de Enseñanza Superior | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Springer | es |
dc.relation.ispartof | Journal of Global Optimization, 18 (2), 195-210. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Continuous location | es |
dc.subject | Polyhedral gauges | es |
dc.subject | Finite dominating sets | es |
dc.subject | Approximation | es |
dc.subject | Sandwich algorithm | es |
dc.subject | Greedy algorithm | es |
dc.title | Solving nonconvex planar location problems by nite dominating sets | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/submittedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Estadística e Investigación Operativa | es |
dc.relation.projectID | PB96-1416-C02-02 | es |
dc.relation.publisherversion | http://download.springer.com/static/pdf/497/art%253A10.1023%252FA%253A1008395305189.pdf?originUrl=http%3A%2F%2Flink.springer.com%2Farticle%2F10.1023%2FA%3A1008395305189&token2=exp=1481282172~acl=%2Fstatic%2Fpdf%2F497%2Fart%25253A10.1023%25252FA%25253A1008395305189.pdf%3ForiginUrl%3Dhttp%253A%252F%252Flink.springer.com%252Farticle%252F10.1023%252FA%253A1008395305189*~hmac=5960aa94077c042ff8b01592890497aa48adad45c2d598493fb02bcb562c8eb6 | es |
dc.identifier.doi | 10.1023/A:1008395305189 | es |
dc.contributor.group | Universidad de Sevilla. FQM329: Optimización | es |
idus.format.extent | 19 p. | es |
dc.journaltitle | Journal of Global Optimization | es |
dc.publication.volumen | 18 | es |
dc.publication.issue | 2 | es |
dc.publication.initialPage | 195 | es |
dc.publication.endPage | 210 | es |
dc.identifier.idus | https://idus.us.es/xmlui/handle/11441/49901 | |
dc.contributor.funder | Dirección General de Enseñanza Superior. España | |