MIP model-based heuristics for the minimum weighted tree reconstruction problem
Year of publication: |
2022
|
---|---|
Authors: | Fajarda, Olga ; Requejo, Cristina |
Published in: |
Operational research : an international journal. - Berlin : Springer, ISSN 1866-1505, ZDB-ID 2425760-6. - Vol. 22.2022, 3, p. 2305-2342
|
Subject: | Mixed integer linear programming | Balanced minimum evolution problem | Feasibility pump | Local branching | Matheuristics | Minimum evolution problem | Routing topology inference | Topology discovery | Tree realization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics |
-
Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
Fortz, Bernard, (2017)
-
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem
Dell'Amico, Mauro, (2020)
-
Formations and heuristics for the multi-item uncapacitated lot-sizing problem with inventory bounds
Melo, Rafael A., (2017)
- More ...
-
Using decomposition to improve greedy solutions of the optimal diversity management problem
Agra, Agostinho, (2013)
-
Rodrigues, Filipe, (2021)
-
Requejo, Cristina, (2020)
- More ...