Use este identificador para citar ou linkar para este item:
http://www.repositorio.ufop.br/jspui/handle/123456789/11352
Registro completo de metadados
Campo Dublin Core | Valor | Idioma |
---|---|---|
dc.contributor.author | Rezende, Josiane da Costa Vieira | - |
dc.contributor.author | Souza, Marcone Jamilson Freitas | - |
dc.contributor.author | Coelho, Vitor Nazário | - |
dc.contributor.author | Martins, Alexandre Xavier | - |
dc.date.accessioned | 2019-05-28T14:32:22Z | - |
dc.date.available | 2019-05-28T14:32:22Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | REZENDE, J. da C. V. et al. HMS : a hybrid multi-start algorithm for solving binary linear programs. Electronic Notes In Discrete Mathematics, v. 66, p. 7-14, abr. 2018. Disponível em: <https://www.sciencedirect.com/science/article/pii/S1571065318300489>. Acesso em: 19 fev. 2019. | pt_BR |
dc.identifier.issn | 1571-0653 | - |
dc.identifier.uri | http://www.repositorio.ufop.br/handle/123456789/11352 | - |
dc.description.abstract | This work presents a hybrid multi-start algorithm for solving generic binary linear programs. This algorithm, called HMS, is based on a Multi-Start Metaheuristic and combines exact and heuristic strategies to address the problem. The initial solutions are generated by a strategy that applies linear programming and constraint propagation for defining an optimized set of fixed variables. In order to refine them, a local search, guided by a Variable Neighborhood Descent heuristic, is called, which, in turn, uses Local Branching cuts. The algorithm was tested in a set of binary LPs from the MIPLIB 2010 library and the results pointed out its competitive performance, resulting in a promising matheuristic. | pt_BR |
dc.language.iso | en_US | pt_BR |
dc.rights | restrito | pt_BR |
dc.subject | Variable neighborhood descent | pt_BR |
dc.subject | Heuristic | pt_BR |
dc.subject | Local branching | pt_BR |
dc.subject | Binary problems | pt_BR |
dc.subject | Constraint propagation | pt_BR |
dc.title | HMS : a hybrid multi-start algorithm for solving binary linear programs. | pt_BR |
dc.type | Artigo publicado em periodico | pt_BR |
dc.identifier.uri2 | https://www.sciencedirect.com/science/article/pii/S1571065318300489 | pt_BR |
dc.identifier.doi | https://doi.org/10.1016/j.endm.2018.03.002 | pt_BR |
Aparece nas coleções: | DEENP - Artigos publicados em periódicos |
Arquivos associados a este item:
Arquivo | Descrição | Tamanho | Formato | |
---|---|---|---|---|
ARTIGO_HMSHybridMulti-start.pdf Restricted Access | 233,24 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.