Use este identificador para citar ou linkar para este item:
http://www.repositorio.ufop.br/jspui/handle/123456789/12959
Título: | A comparison of separation routines for benders optimality cuts for two-level facility location problems. |
Autor(es): | Oliveira, Paganini Barcellos de Contreras, Ivan Camargo, Ricardo Saraiva de Miranda Junior, Gilberto de |
Palavras-chave: | Discrete location Multi-level facility location Benders decomposition Pareto-optimal cuts |
Data do documento: | 2020 |
Referência: | OLIVEIRA, P. B. de et al. A comparison of separation routines for benders optimality cuts for two-level facility location problems. Expert Systems with Applications, v. 141, mar. 2020. Disponível em: <https://www.sciencedirect.com/science/article/abs/pii/S0957417419306463>. Acesso em: 10 mar. 2020. |
Resumo: | This paper studies two-level uncapacitated facility location problems, a class of discrete location problems that consider different hierarchies of facilities and their interactions. Benders reformulations for both single and multiple assignment variants and while several separation procedures for three classes of Benders cuts are presented: standard optimality cuts, lifted optimality cuts, and non-dominated optimality cuts. Extensive computational experiments are performed on difficult and large-scale benchmark instances to assess the performance of the considered separation routines. |
URI: | http://www.repositorio.ufop.br/handle/123456789/12959 |
Link para o artigo: | https://www.sciencedirect.com/science/article/abs/pii/S0957417419306463?via%3Dihub#! |
DOI: | https://doi.org/10.1016/j.eswa.2019.112928 |
ISSN: | 0957-4174 |
Aparece nas coleções: | DEENP - Artigos publicados em periódicos |
Arquivos associados a este item:
Arquivo | Descrição | Tamanho | Formato | |
---|---|---|---|---|
ARTIGO_ComparisonSeparationRoutines.pdf Restricted Access | 914,56 kB | Adobe PDF | Visualizar/Abrir |
Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.