Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRezende, Josiane da Costa Vieira-
dc.contributor.authorSouza, Marcone Jamilson Freitas-
dc.contributor.authorCoelho, Vitor Nazário-
dc.contributor.authorMartins, Alexandre Xavier-
dc.identifier.citationREZENDE, 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: <>. Acesso em: 19 fev. 2019.pt_BR
dc.description.abstractThis 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.subjectVariable neighborhood descentpt_BR
dc.subjectLocal branchingpt_BR
dc.subjectBinary problemspt_BR
dc.subjectConstraint propagationpt_BR
dc.titleHMS : a hybrid multi-start algorithm for solving binary linear programs.pt_BR
dc.typeArtigo publicado em periodicopt_BR
Appears in Collections:DEENP - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
  Restricted Access
233,24 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.