A comparison of separation routines for benders optimality cuts for two-level facility location problems.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorOliveira, Paganini Barcellos de-
Autor(es): dc.creatorContreras, Ivan-
Autor(es): dc.creatorCamargo, Ricardo Saraiva de-
Autor(es): dc.creatorMiranda Junior, Gilberto de-
Data de aceite: dc.date.accessioned2022-02-21T19:58:19Z-
Data de disponibilização: dc.date.available2022-02-21T19:58:19Z-
Data de envio: dc.date.issued2020-11-19-
Data de envio: dc.date.issued2020-11-19-
Data de envio: dc.date.issued2019-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/12959-
Fonte completa do material: dc.identifierhttps://www.sciencedirect.com/science/article/abs/pii/S0957417419306463?via%3Dihub#!-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.eswa.2019.112928-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/650425-
Descrição: dc.descriptionThis 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.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectDiscrete location-
Palavras-chave: dc.subjectMulti-level facility location-
Palavras-chave: dc.subjectBenders decomposition-
Palavras-chave: dc.subjectPareto-optimal cuts-
Título: dc.titleA comparison of separation routines for benders optimality cuts for two-level facility location problems.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.