MIP model-based heuristics for the minimum weighted tree reconstruction problem

We consider the Minimum Weighted Tree Reconstruction (MWTR) problem and two matheuristic methods to obtain optimal or near-optimal solutions: the Feasibility Pump heuristic and the Local Branching heuristic. These matheuristics are based on a Mixed Integer Programming (MIP) model used to find feasib...

ver descrição completa

Detalhes bibliográficos
Autor principal: Fajarda, Olga (author)
Outros Autores: Requejo, Cristina (author)
Formato: article
Idioma:eng
Publicado em: 2022
Assuntos:
Feasibility pump
Local branching
Mixed integer linear programming
Matheuristics
Tree realization
Topology discovery
Routing topology inference
Minimum evolution problem
Balanced minimum evolution problem
Texto completo:http://hdl.handle.net/10773/35031
País:Portugal
Oai:oai:ria.ua.pt:10773/35031

Texto Completo

http://hdl.handle.net/10773/35031

Registos relacionados