Por favor, use este identificador para citar o enlazar este ítem:
https://hdl.handle.net/11000/34259
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Anton-Sanchez, Laura | - |
dc.contributor.author | G.-Tóth, Boglárka | - |
dc.contributor.author | Fernández, José | - |
dc.contributor.other | Departamentos de la UMH::Estadística, Matemáticas e Informática | es_ES |
dc.date.accessioned | 2025-01-10T08:59:36Z | - |
dc.date.available | 2025-01-10T08:59:36Z | - |
dc.date.created | 2024 | - |
dc.identifier.citation | European Journal of Operational Research | es_ES |
dc.identifier.issn | 1872-6860 | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.uri | https://hdl.handle.net/11000/34259 | - |
dc.description.abstract | The problem of an expanding chain in a given area is considered. It may locate a new facility, vary the quality of its existing facilities, close some of them, or a combination of all these possibilities, whatever is the best to maximize its profit, given a budget for the expansion. A new competitive location and design model is proposed that allows all these possibilities. The resulting model is a difficult to solve MINLP problem. A branch-and-bound method based on interval analysis is proposed to cope with it. The method can solve medium-size problems in a reasonable amount of CPU time. An ad-hoc heuristic and a hybrid method that usually find a near-optimal solution in a fraction of time of the exact method are also proposed. Some computational studies are presented to show the performance of the algorithms. | es_ES |
dc.format | application/pdf | es_ES |
dc.format.extent | 17 | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | Elsevier | es_ES |
dc.relation.ispartofseries | 313 | es_ES |
dc.relation.ispartofseries | 3 | es_ES |
dc.rights | info:eu-repo/semantics/closedAccess | es_ES |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Location | es_ES |
dc.subject | MINLP | es_ES |
dc.subject | Branch-and-bound | es_ES |
dc.subject | Heuristic | es_ES |
dc.subject | Hybrid algorithm | es_ES |
dc.subject.other | CDU::5 - Ciencias puras y naturales::51 - Matemáticas | es_ES |
dc.title | A Huff-like location model with quality adjustment and/or closing of existing facilities | es_ES |
dc.type | info:eu-repo/semantics/article | es_ES |
dc.relation.publisherversion | https://doi.org/10.1016/j.ejor.2023.08.054 | es_ES |

2024 G.-Tóth et al-EJOR.pdf
1,35 MB
Adobe PDF
Compartir:
La licencia se describe como: Atribución-NonComercial-NoDerivada 4.0 Internacional.